Trees with diameter less than 5 and non-singular complement

DOI10.1016/0012-365X(94)00086-XMaRDI QIDQ1916382zbMATH OpenOpenAlexFDO

Authors Severino V. Gervacio

Publication date 3 July 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)00086-x

zbMATH Keywords

adjacency matrixdiametertrees

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

A graph \(G\) is called singular if the adjacency matrix of \(G\) is singular. The paper determines all trees with diameter less than 5 whose complement is non-singular.

Cites work

• scientific article; zbMATH DE number 4087693 (Why is no real title available?)
• scientific article; zbMATH DE number 3895098 (Why is no real title available?)
• Parallel concepts in graph theory

Cited in

(5)

• On the fold thickness of graphs
• scientific article; zbMATH DE number 6509359 (Why is no real title available?)
• Fold thickness of graphs
• Solvable Trees
• A note on fold thickness of graphs

This page was built for publication: Trees with diameter less than 5 and non-singular complement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916382)