Some Comments on the Eigenspaces of Graphs
Dragoš M. Cvetković (1991)
Publications de l'Institut Mathématique
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements.”
Some Comments on the Eigenspaces of Graphs
Independent vertex sets in some compound graphs.
Gutman, Ivan (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
On generalized outerplanarity of line graphs
Jiří Sedláček (1990)
Časopis pro pěstování matematiky
Similarity:
The matching polynomial of a distance-regular graph.
Beezer, Robert A., Farrell, E.J. (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Greatest common subgraphs of graphs
Gary Chartrand, Farrokh Saba, Hung Bin Zou (1987)
Časopis pro pěstování matematiky
Similarity:
A characterization of -closed graphs
Pavol Híc (1989)
Mathematica Slovaca
Similarity: