Graphs with the Reduced Spectrum in the Unit Interval
Aleksandar Torgašev (1984)
Publications de l'Institut Mathématique
Similarity:
Aleksandar Torgašev (1984)
Publications de l'Institut Mathématique
Similarity:
Aleksandar Torgašev (1982)
Publications de l'Institut Mathématique
Similarity:
Jill Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Brent J. Thomas (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from G̅ to G results in a copy of H. The minimum size of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum size is the well studied extremal number, ex(n,H). The saturation spectrum for a graph H is the set of sizes of H saturated graphs between sat(n,H) and ex(n,H). In this paper we completely determine the saturation spectrum of stars and we show the saturation spectrum of paths...
Mieczyslaw Borowiecki (1985)
Publications de l'Institut Mathématique
Similarity:
Boulet, R., Jouve, B. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
D. M. Cvetković, I. M. Gutman (1972)
Matematički Vesnik
Similarity:
Mirko Lepović (2003)
Publications de l'Institut Mathématique
Similarity:
D.M. Cvetkovic (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Lepović, Mirko (1998)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Torgasev, Aleksandar (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: