Characterizations of non-singular cycles and trees

MaRDI QIDQ3540341zbMATH OpenFDO

Authors Supot Sookyang, Piotr Wojtylak, Sr. Arworn

Publication date 20 November 2008

zbMATH Keywords

adjacency matrixcycle, treemple graphnon-singular graph

Mathematics Subject Classification ID

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

Recommendations

• Characterizations of non-singular cycles, path 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

(11)

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

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)