Permanents of graphs with cut vertices

DOI10.1080/0308108031000106649zbMATH Open1036.05031OpenAlexW2070551158MaRDI QIDQ4455141FDOQ4455141

Authors: Suk-Geun Hwang, Xiao-Dong Zhang 

Publication date: 16 March 2004

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0308108031000106649

Recommendations

• Some analytical properties of the permanental polynomial of a graph.
• A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\).
• On the permanental sum of graphs
• Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
• Publication:4943290

zbMATH Keywords

adjacency matrixconvectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15) Connectivity (05C40)

Cited In (8)

• The coefficients of the immanantal polynomial
• On the maximum Zagreb indices of graphs with \(k\) cut vertices
• Properties of the extended graph permanent
• Permanents of almost regular complete bipartite graphs
• On characteristic and permanent polynomials of a matrix
• Permanent, determinant, and rank of bi-block graphs
• Title not available (Why is that?)
• Parameterized complexity of determinant and permanent

This page was built for publication: Permanents of graphs with cut vertices

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