scientific article; zbMATH DE number 4210179

MaRDI QIDQ3358760zbMATH OpenFDO

Authors

Publication date 1989

zbMATH Keywords

adjacency matrixchromatic numberclique numberDilworth numberdomination numberinequalities

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Recommendations

• On the rank of a matrix associated with a graph.
• Relationship between the rank and the matching number of a graph
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• A bound for the Dilworth number
• Rank, term rank and chromatic number of a graph

Cited in

(10)

• The determinant of a tree's neighborhood matrix
• The determinant of a unicyclic graph's neighborhood matrix
• Rank inequalities for chordal graphs
• Inequalities involving the irredundance number of a graph
• On rank of a matrix associated with graph
• Irredundance
• Note on Graphs and Matrix Inequalities
• Solvability of Graph Inequalities
• A bound for the Dilworth number
• Open irredundance and maximum degree in graphs

This page was built for publication:

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