Characterizations of non-singular cycles and trees

zbMATH Open1172.05313MaRDI QIDQ3540341FDOQ3540341

Authors: Supot Sookyang, Piotr Wojtylak, Sr. Arworn 

Publication date: 20 November 2008

Recommendations

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

zbMATH Keywords

adjacency matrixnon-singular graphcycle, treemple graph

Mathematics Subject Classification ID

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

Cited In (11)

• A note on the singularity of oriented graphs
• Characterizations of non-singular cycles, path and trees
• Nonsingular (vertex-weighted) block graphs
• Singularity of oriented graphs from several classes
• Trees with diameter 5 and non-singular complement
• Non-singular complement of a tree with diameter 5
• Increasing trees and Kontsevich cycles
• Ray nonsingularity of cycle tree matrices
• Linear time algorithm to check the singularity of block graphs
• Two graphs with a common edge
• Cycles in squares of trees without generalized claws

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

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