Edge covers of caterpillars, cycles with pendants, and spider graphs

MaRDI QIDQ6178534zbMATH OpenFDO

Authors Feryal Alayont

Publication date 16 January 2024

Full work available at URL https://cs.uwaterloo.ca/journals/JIS/VOL26/Alayont/ala4.html

zbMATH Keywords

edge coverFibonacci numberpendantcycle graphcaterpillar graphspider graph2-sum

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Special sequences and polynomials (11B83)

Recommendations

• On the edge cover polynomial of a graph
• On the roots of edge cover polynomials of graphs
• On the edge cover polynomial of certain graphs
• Covering the edges of a connected graph by paths

Cites work

• A missing prime configuration in the Hausdorff metric geometry
• Missing edge coverings of bipartite graphs and the geometry of the Hausdorff metric
• On the edge cover polynomial of a graph
• On the roots of edge cover polynomials of graphs
• Realizability of graphs

This page was built for publication: Edge covers of caterpillars, cycles with pendants, and spider graphs

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