On constructing graphs with the same status sequence.

zbMATH Open1313.05100MaRDI QIDQ2936731FDOQ2936731

Authors: Jen-Ling Shang 

Publication date: 6 January 2015

Recommendations

• Pairs of a tree and a nontree graph with the same status sequence
• On the status sequences of trees
• Weakly status injective trees are status unique in trees.
• Constructing status injective graphs
• Spiders are status unique in trees

zbMATH Keywords

status sequencestatus of a vertex

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12)

Cited In (4)

• Spiders are status unique in trees
• Pairs of a tree and a nontree graph 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: On constructing graphs with the same status sequence.

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