Constructing status injective graphs

DOI10.1016/S0166-218X(97)00073-5MaRDI QIDQ1377622zbMATH OpenWikidataFDO

Authors Lior Pachter

Publication date 8 April 1998

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

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

Wiener indexdistance-sumstatus sequence

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3855166 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• Graph multiplication

Cited in

(7)

• Weakly status injective trees are status unique in trees.
• On the status sequences of trees
• scientific article; zbMATH DE number 2230268 (Why is no real title available?)
• Pairs of a tree and a nontree graph with the same status sequence
• scientific article; zbMATH DE number 2170454 (Why is no real title available?)
• On constructing graphs with the same status sequence.
• Spiders are status unique in trees

This page was built for publication: Constructing status injective graphs

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