Maximal Graphs with Given Connectivity and Edge-Connectivity
Ferdinand Gliviak (1975)
Matematický časopis
Similarity:
Ferdinand Gliviak (1975)
Matematický časopis
Similarity:
Allan Bickle (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer sequences that can be the degree sequence of some k-monocore graph are characterized as follows. A nonincreasing sequence of integers d0, . . . , dn is the degree sequence of some k-monocore graph G, 0 ≤ k ≤ n − 1, if and only if k ≤ di ≤ min {n − 1, k + n − i} and ⨊di = 2m, where m satisfies [...] ≤ m ≤ k ・ n − [...] .
Peter Horák (1982)
Mathematica Slovaca
Similarity:
Gutman, Ivan (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Ľubomír Šoltés (1992)
Mathematica Slovaca
Similarity:
Simic, Slobodan K. (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Cvetković, D., Rowlinson, P. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Martin Knor (2007)
Discussiones Mathematicae Graph Theory
Similarity:
There is a hypothesis that a non-selfcentric radially-maximal graph of radius r has at least 3r-1 vertices. Using some recent results we prove this hypothesis for r = 4.
Gabriel Semanišin (1997)
Discussiones Mathematicae Graph Theory
Similarity:
A set P of graphs is termed hereditary property if and only if it contains all subgraphs of any graph G belonging to P. A graph is said to be maximal with respect to a hereditary property P (shortly P-maximal) whenever it belongs to P and none of its proper supergraphs of the same order has the property P. A graph is P-extremal if it has a the maximum number of edges among all P-maximal graphs of given order. The number of its edges is denoted by ex(n, P). If the number of edges...