Spiders are status unique in trees

DOI10.1016/J.DISC.2011.01.020zbMATH Open1223.05029OpenAlexW2040676539MaRDI QIDQ534035FDOQ534035

Authors: Jen-Ling Shang, Chiang Lin 

Publication date: 10 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.01.020

Recommendations

• Weakly status injective trees are status unique in trees.
• Pairs of a tree and a nontree graph with the same status sequence
• On the status sequences of trees
• On constructing graphs with the same status sequence.
• Minimum status of trees with given parameters

zbMATH Keywords

treespiderstatusstatus sequencestatus unique graph

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Cites Work

• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Distance in graphs
• Title not available (Why is that?)
• Counterexamples to randić's conjecture on distance degree sequences for trees
• Title not available (Why is that?)
• Some properties of a centroid of a free tree
• Constructing status injective graphs
• Title not available (Why is that?)

Cited In (6)

• Pairs of a tree and a nontree graph with the same status sequence
• Finding safe strategies for competitive diffusion on trees
• Title not available (Why is that?)
• On constructing graphs with the same status sequence.
• Weakly status injective trees are status unique in trees.
• On the status sequences of trees

This page was built for publication: Spiders are status unique in trees

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