Independence number in path graphs

MaRDI QIDQ5478339zbMATH OpenFDO

Authors Martin Knor, Ludovit Niepel

Publication date 13 July 2006

zbMATH Keywords

(non)deterministic algorithmgraph dynamicsindependence numberiterated line graphpath graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Independence numbers of path power, flower snark and multi-cone graphs
• scientific article; zbMATH DE number 6694457
• Path graphs
• Independence number of iterated line digraphs
• scientific article; zbMATH DE number 1933263

Cited in

(7)

• Independence number of iterated line digraphs
• Index of parameters of iterated line graphs
• Independence numbers of path power, flower snark and multi-cone graphs
• Histories in Path Graphs
• scientific article; zbMATH DE number 4142085 (Why is no real title available?)
• Toggling independent sets of a path graph
• Independence numbers of some double vertex graphs and pair graphs

This page was built for publication: Independence number in path graphs

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