Discussing graph theory with a computer. II: Theorems suggested by the computer.

Cvetkovic, Dragos M.

The search session has expired. Please query the service again.

Displaying similar documents to “Discussing graph theory with a computer. II: Theorems suggested by the computer.”

Some results on graphs with at most two positive eigenvalues.

Petrović, Miroslav (1991)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

On the numbers of positive and negative eigenvalues of a graph.

Torgašev, Aleksandar (1992)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Note on enumeration of labeled split graphs

Vladislav Bína, Jiří Přibil (2015)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The paper brings explicit formula for enumeration of vertex-labeled split graphs with given number of vertices. The authors derive this formula combinatorially using an auxiliary assertion concerning number of split graphs with given clique number. In conclusion authors discuss enumeration of vertex-labeled bipartite graphs, i.e., a graphical class defined in a similar manner to the class of split graphs.

Graph equations, graph inequalities and a fixed point theorem.

I.B. Lackovic, D.M. Cvetkovic (1976)

Publications de l'Institut Mathématique [Elektronische Ressource]

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...