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.
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.
Dragoš M. Cvetković (1991)
Publications de l'Institut Mathématique
Similarity:
Ivan Gutman, Bojana Borovićanin (2011)
Zbornik Radova
Similarity:
Bijana Borovićanin, Ivan Gutman (2009)
Zbornik Radova
Similarity:
Gyárfás, András, Zaker, Manouchehr (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dragoš Cvetković, Tatjana Davidović (2008)
The Yugoslav Journal of Operations Research
Similarity:
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Ivan Gutman, Yeong Nan Yeh (1995)
Mathematica Slovaca
Similarity:
David E. Brown, Breeann M. Flesch, J. Richard (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P. We characterize the 2-trees which are probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by Pržulj and Corneil in [2-tree probe interval graphs have a large obstruction set, Discrete Appl....
Tanja Gologranc (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227-240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and give a new proof of that result, which holds also for a bigger class of graphs, so called tree-like...
H. S. Ramane, D. S. Revankar, I. Gutman, H. B. Walikar (2009)
Publications de l'Institut Mathématique
Similarity: