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

distance-sumstatus sequenceWiener index

Mathematics Subject Classification ID

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

Review text

A graph is status injective if all its vertices have different status (sum of distances to all other vertices). Infinite families of graphs are constructed with consecutive integers as stati. Any given graph is an induced subgraph of any number of nonisomorphic status injective graphs. Thus the status sequence is a valuable distance-related invariant, but it also is highly degenerate.

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

• Graph multiplication
• 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?)

Cited in

(7)

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

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)