On the characteristic polynomial of the power of a path.

DOI10.4067/S0716-09172017000300529zbMath1397.05083OpenAlexW2767054218MaRDI QIDQ4691305

Beatriz Malajovich, Lilian Markenzon, Nair Maria Maia De Abreu

Publication date: 23 October 2018

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4067/s0716-09172017000300529

zbMATH Keywords

4-cyclespower of a pathcharacteristic coefficients

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Finding and counting given length cycles
• On the power of a perturbation for testing non-isomorphism of graphs
• A clique-difference encoding scheme for labelled \(k\)-path graphs
• The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
• Subclasses of \(k\)-trees: characterization and recognition
• Laplacian coefficients of unicyclic graphs with the number of leaves and girth
• The polynomial reconstruction of unicyclic graphs is unique
• Arboricity and Subgraph Listing Algorithms
• Finding short cycles in planar graphs using separators
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph
• Experimental and Efficient Algorithms

This page was built for publication: On the characteristic polynomial of the power of a path.