Permanents of graphs with cut vertices

DOI10.1080/0308108031000106649MaRDI QIDQ4455141zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

adjacency matrixconvectivity

Mathematics Subject Classification ID

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

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

Cited in

(11)

• On characteristic and permanent polynomials of a matrix
• Properties of the extended graph permanent
• The coefficients of the immanantal polynomial
• Parameterized complexity of determinant and permanent
• Permanent, determinant, and rank of bi-block graphs
• scientific article; zbMATH DE number 1990713 (Why is no real title available?)
• Permanents of almost regular complete bipartite graphs
• Further results on permanents of Laplacian matrices of trees
• Two problems on Laplacian ratios of trees
• Solution to an open problem on Laplacian ratio
• On the maximum Zagreb indices of graphs with \(k\) cut vertices

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)