Some results on graphs with at most two positive eigenvalues.
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity:
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Gliviak, Ferdinand, Kyš, P. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Ľubomír Šoltés (1990)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Peter Hudák, Mária Maceková, Tomáš Madaras, Pavol Široczki (2016)
Discussiones Mathematicae Graph Theory
Similarity:
A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K) degG(x) ≤ w(H, 𝒢). In this paper, we investigate light graphs in families of plane graphs of minimum degree 2 with prescribed girth and no adjacent 2-vertices, specifying several necessary conditions for their lightness and providing sharp bounds on φ and w...