A linear algorithm for the neighbor-component order connectivity of arbitrary trees

DOI10.1142/S179383092250183XMaRDI QIDQ6542929zbMATH OpenFDO

Authors Kristi Luttrell

Publication date 23 May 2024

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S179383092250183X

zbMATH Keywords

complexitycomponent order connectivitydominationneighbor-component order connectivityneighbor-connectivitytree algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The relationship between neighbor-connectivity, component order connectivity and neighbor-component order connectivity
• scientific article; zbMATH DE number 6863758
• An exceptional invariant k-component order neighbor connectivity -- a generalization of domination alteration sets in graphs
• Component order edge connectivity -- an introduction

Cites work

• A linear algorithm for the domination number of a tree
• Graphs \& digraphs
• scientific article; zbMATH DE number 1472195 (Why is no real title available?)
• scientific article; zbMATH DE number 867625 (Why is no real title available?)
• Neighbor-connected graphs and projective planes
• Neighbour-connectivity in regular graphs
• On Designing a Reliable Hierarchical Structure
• The relationship between neighbor-connectivity, component order connectivity and neighbor-component order connectivity

Cited in

(1)

• An algorithm for the domination number and neighbor-component order connectivity of a unicycle

This page was built for publication: A linear algorithm for the neighbor-component order connectivity of arbitrary trees

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