The path polynomial of a complete graph

DOI10.13001/1081-3810.1103MaRDI QIDQ4450690zbMATH OpenOpenAlexFDO

Authors C. M.da Fonseca

Publication date 15 February 2004

Published in The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/123329, http://www.emis.de/journals/ELA/ela-articles/abstracts/abs_vol10_pp155-162.text

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graphLaplacian matrixadjacency matrixcharacteristic polynomial

Mathematics Subject Classification ID

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

Recommendations

• Path polynomials of a circuit: a constructive approach
• scientific article; zbMATH DE number 167520
• Path-positive graphs
• The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
• Decompositions of complete graphs into paths and cycles.

Cited in

(1)

• Geodetic polynomials of n-Sunlet and triangular snake TS_n graphs

This page was built for publication: The path polynomial of a complete graph

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