Characterizations of non-singular cycles, path and trees

MaRDI QIDQ5324062zbMATH OpenFDO

Authors Supot Sookyang, Piotr Wojtylak, Sr. Arworn

Publication date 3 August 2009

zbMATH Keywords

simple graph, adjacency matrix, non-singular graph, cycle, tree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Deterministic network models in operations research (90B10)

Recommendations

• Characterizations of non-singular cycles and trees
• scientific article; zbMATH DE number 6438262
• scientific article; zbMATH DE number 6509359
• Non-singular complement of a tree with diameter 5
• A characterization of singular graphs

Cited in

(8)

• Characterizations of non-singular cycles and trees
• Trees with diameter 5 and non-singular complement
• Independence and matching numbers of unicyclic graphs from null space
• Smith forms for adjacency matrices of circulant graphs
• Nonsingular (vertex-weighted) block graphs
• The singularity of the adjacency matrix of an interactive bicycle graph
• Paths and cycles as tools for the characterization of some classes of matrices
• A note on the singularity of oriented graphs

This page was built for publication: Characterizations of non-singular cycles, path and trees

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