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

DOI10.1142/S179383092250183XzbMATH Open1537.0503MaRDI QIDQ6542929FDOQ6542929

Authors: Kristi Luttrell 

Publication date: 23 May 2024

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

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

zbMATH Keywords

complexitydominationtree algorithmcomponent order connectivityneighbor-component order connectivityneighbor-connectivity

Mathematics Subject Classification ID

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

Cites Work

• Graphs \& digraphs
• A linear algorithm for the domination number of a tree
• The relationship between neighbor-connectivity, component order connectivity and neighbor-component order connectivity
• Neighbour-connectivity in regular graphs
• On Designing a Reliable Hierarchical Structure
• Neighbor-connected graphs and projective planes
• Title not available (Why is that?)
• Title not available (Why is that?)

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)