On constructing graphs with the same status sequence.

MaRDI QIDQ2936731zbMATH OpenFDO

Authors Jen-Ling Shang

Publication date 6 January 2015

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)

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

Cited in

(4)

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