Some results on graphs with at most two positive eigenvalues.
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Displaying similar documents to “On Graph-Based Cryptography and Symbolic Computations”
Some results on graphs with at most two positive eigenvalues.
Discussing graph theory with a computer. II: Theorems suggested by the computer.
Cvetkovic, Dragos M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Infinite precise objects
Jaroslav Nešetřil (1978)
Mathematica Slovaca
Similarity:
Old and new generalizations of line graphs.
Bagga, Jay (2004)
International Journal of Mathematics and Mathematical Sciences
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.
The adjacency graphs of a complex
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity:
Dynamic cage survey.
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bipartite toughness and -factors in bipartite graphs.
Liu, Guizhen, Qian, Jianbo, Sun, Jonathan Z., Xu, Rui (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity: