Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("DIAMETRE GRAPHE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 92

  • Page / 4
Export

Selection :

  • and

ON DIAMETER STABILITY OF GRAPHS.HARTMAN J; RUBIN I.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 247-254; BIBL. 8 REF.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

ON CERTAIN EDGE-CRITICAL GRAPHS OF A GIVEN DIAMETER.GLIVIAK F.1975; MAT. CAS.; CESKOSL.; DA. 1975; VOL. 25; NO 3; PP. 249-263; BIBL. 9 REF.Article

GEODETIC GRAPHS OF DIAMETER TWO.STEMPLE JG.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 3; PP. 266-280; BIBL. 5 REF.Article

GRAPHS WITH SPECIFIED RADIUS AND DIAMETEROSTRAND PA.1973; DISCRETE MATH.; NETHERL.; DA. 1973; VOL. 4; NO 1; PP. 71-75; BIBL. 1 REF.Serial Issue

BERGE'S THEOREM FOR INFINITE TOURNAMENTSPOOLE G; BOULLION T.1972; INDUSTR. MATH.; U.S.A.; DA. 1972; VOL. 22; NO 1; PP. 39-43; BIBL. 2 REF.Serial Issue

THE GENERALIZED DIAMETER OF A GRAPHCHIH KANG ERIC CHEN; GARFINKEL RS.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 3; PP. 335-340; BIBL. 5 REF.Article

DIAMETERS OF RANDOM GRAPHSKLEE V; LARMAN D.1981; CAN. J. MATH.; ISSN 0008-414X; CAN; DA. 1981; VOL. 33; NO 3; PP. 618-640; BIBL. 5 REF.Article

THE DIAMETER OF GRAPHS: A SURVEYBERMOND JC; BOLLOBAS B.1981; SOUTHEASTERN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND COMPUTING. 12/1981/LOUISIANA STATE UNIVERSITY LA; CAN; WINNIPEG: UTILITAS MATHEMATICA PUBLISHING; DA. 1981; PP. 3-27; BIBL. 8 P.Conference Paper

THE DIAMETER OF RANDOM GRAPHSBOLLOBAS B.1981; TRANS. AM. MATH. SOC.; ISSN 0002-9947; USA; DA. 1981; VOL. 267; NO 1; PP. 41-52; BIBL. 19 REF.Article

ON DIAMETER CRITICAL GRAPHSCACCETTA L; HAGGKVIST R.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 3; PP. 223-229; BIBL. 2 REF.Article

THE DIAMETER OF THE GRAPH OF A SEMIRING.NAKASSIS A.1976; PROC. AMER. MATH. SOC.; U.S.A.; DA. 1976-10; VOL. 60; PP. 353-359; BIBL. 4 REF.Article

THE COUNTING AND CODING OF TREES OF FIXED DIAMETER. = DENOMBREMENT ET CODAGE D'ARBRES DE DIAMETRE FIXEGORDON M; KENNEDY JW.1975; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1975; VOL. 28; NO 2; PP. 376-398; BIBL. 22 REF.Article

TACTICAL CONFIGURATIONS: AN INTRODUCTION.LONGYEAR JQ.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 406; PP. 325-329; BIBL. 7 REF.; (GRAPHS AND COMB. PROC. CAP. CONF. GRAPH THEORY COMB.; WASHINGTON; 1973)Conference Paper

THE EXISTENCE OF SMALL TACTICAL CONFIGURATIONS.LIPMAN MJ.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 406; PP. 319-324; BIBL. 3 REF.; (GRAPHS AND COMB. PROC. CAP. CONF. GRAPH THEORY COMB.; WASHINGTON; 1973)Conference Paper

ONE METHOD FOR PROVING THE IMPOSSIBILITY OF CERTAIN MOORE GRAPHS.PLESNIK J.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 8; NO 4; PP. 363-376; BIBL. 16 REF.Article

COMPUTING EXTREMAL AND APPROXIMATE DISTANCES IN GRAPHS HAVING UNIT COST EDGESBOOTH KS; LIPTON RJ.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 4; PP. 319-328; BIBL. 8 REF.Article

Diameter vulnerability of graphsPEYRAT, C.Discrete applied mathematics. 1984, Vol 9, Num 3, pp 245-250, issn 0166-218XArticle

The Randić index and the diameter of graphsYITING YANG; LINYUAN LU.Discrete mathematics. 2011, Vol 311, Num 14, pp 1333-1343, issn 0012-365X, 11 p.Article

A family of regular graphs of girth 5ABREU, M; FUNK, M; LABBATE, D et al.Discrete mathematics. 2008, Vol 308, Num 10, pp 1810-1815, issn 0012-365X, 6 p.Article

Diameters of cubic graphsJØRGENSEN, L. K.Discrete applied mathematics. 1992, Vol 37-38, pp 347-351, issn 0166-218XArticle

On the diameter of generalized Kneser graphsYONGZHU CHEN; YINGQIAN WANG.Discrete mathematics. 2008, Vol 308, Num 18, pp 4276-4279, issn 0012-365X, 4 p.Article

A note on large cayley graphs of diameter two and given degreeSIAGIOVA, Jana; SIRAN, Jozef.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 379-382, issn 0012-365X, 4 p.Article

On the diameter of Kneser graphsVALENCIA-PABON, Mario; VERA, Juan-Carlos.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 383-385, issn 0012-365X, 3 p.Article

2-Neighborhoods and Hamiltonian conditionsSHI RONGHUA.Journal of graph theory. 1992, Vol 16, Num 3, pp 267-271, issn 0364-9024Article

An eigenvalue bound for the Laplacian of a graphGROSSMAN, J. P.Discrete mathematics. 2005, Vol 300, Num 1-3, pp 225-228, issn 0012-365X, 4 p.Article

  • Page / 4