Counting set covers and split graphs.
Royle, Gordon F. (2000)
Journal of Integer Sequences [electronic only]
Similarity:
Displaying similar documents to “The join of graphs and the binding minimality”
Counting set covers and split graphs.
Treewidth and minimum fill-in on -trapezoid graphs.
Bodlaender, Hans L., Kloks, Ton, Kratsch, Dieter, Müller, Haiko (1998)
Journal of Graph Algorithms and Applications
Similarity:
Graphs with maximum and minimum independence numbers.
Gutman, Ivan (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A remark on distances in products of graphs
Vladimír Puš (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Generalized line graphs with the second largest eigenvalue at most 1.
Petrović, Miroslav, Milekić, Bojana (2000)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
On -closed graphs
Pavel Tomasta, Eliška Tomová (1988)
Czechoslovak Mathematical Journal
Similarity:
Characterizations of the Family of All Generalized Line Graphs-Finite and Infinite-and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2
Gurusamy Rengasamy Vijayakumar (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976) 305-327], the class of all finite graphs whose least eigenvalues ≥ −2 has been classified: (1) If a (finite) graph is connected and its least eigenvalue is at least −2, then either it is a generalized line graph or it is represented...