Multipartite separability of Laplacian matrices of graphs.
Wu, Chai Wah (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The tripartite separability of density matrices of graphs.”
Multipartite separability of Laplacian matrices of graphs.
The linear complexity of a graph.
Neel, David L., Orrison, Michael E. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Algebraic connectivity of graphs
Miroslav Fiedler (1973)
Czechoslovak Mathematical Journal
Similarity:
Directed graphs and matrix equations
Juraj Bosák (1978)
Mathematica Slovaca
Similarity:
Spectra and Graph Comparison
Charles Delorme (2011)
Publications de l'Institut Mathématique
Similarity:
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Gyula Y. Katona, Morteza Faghani, Ali Reza Ashrafi (2014)
Discussiones Mathematicae Graph Theory
Similarity:
The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.
On the quantum chromatic number of a graph.
Cameron, Peter J., Montanaro, Ashley, Newman, Michael W., Severini, Simone, Winter, Andreas (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nullity of Graphs
Bijana Borovićanin, Ivan Gutman (2009)
Zbornik Radova
Similarity: