On the determinant of the adjacency matrix of a graph with one cycle or non-interactive bicycle

zbMATH Open1150.05031MaRDI QIDQ3501007FDOQ3501007

Authors: Xiaohua Xie, Baoxing Chen, Yu Chen 

Publication date: 3 June 2008

Recommendations

• scientific article; zbMATH DE number 2157272
• Publication:4944827
• scientific article; zbMATH DE number 2154055
• Determinants of adjacency matrices of graphs
• The classification and maximum determinants of the adjacency matrix of graphs with two cycles

zbMATH Keywords

adjacency matrixdeterminantperfect matchinggraph with non-interactive bicyclegraph with one cycle

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Paths and cycles (05C38)

Cited In (13)

• The determinant of a unicyclic graph's neighborhood matrix
• Determinant of graphs joined by two edges
• Title not available (Why is that?)
• The determinant of the adjacency matrix of cycle-power graph \(C_n^4\)
• Determinant of adjacency matrix of square cycle graph
• Determinants of adjacency matrices of graphs
• Title not available (Why is that?)
• Two graphs with a common edge
• The classification and maximum determinants of the adjacency matrix of graphs with two cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• On adjacency matrices and descriptors of signed cycle graphs
• On the determinant of bipartite graphs

This page was built for publication: On the determinant of the adjacency matrix of a graph with one cycle or non-interactive bicycle

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