An efficient algorithm for generating transmission irregular trees
From MaRDI portal
Cites work
- Characterization of transmission irregular starlike and double starlike trees
- Comparing Wiener complexity with eccentric complexity
- Constructing new families of transmission irregular graphs
- scientific article; zbMATH DE number 90560 (Why is no real title available?)
- Infinite family of 2-connected transmission irregular graphs
- Infinite family of 3-connected cubic transmission irregular graphs
- Infinite family of transmission irregular trees of even order
- New transmission irregular chemical graphs
- On 2-connected transmission irregular graphs
- On distances in Sierpiński graphs: almost-extreme vertices and metric dimension
- On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs
- On interval transmission irregular graphs
- On quartic transmission irregular graphs
- On stepwise transmission irregular graphs
- On the status sequences of trees
- On the Wiener index, distance cospectrality and transmission-regular graphs
- On transmission irregular starlike trees
- On transmission-irregular graphs and long pendent paths
- Pairs of a tree and a nontree graph with the same status sequence
- Practical graph isomorphism. II.
- Stepwise transmission irregular graphs
- Total distance, Wiener index and opportunity index in wreath products of star graphs
- Wiener dimension: fundamental properties and (5,0)-nanotubical fullerenes
Cited in
(2)
This page was built for publication: An efficient algorithm for generating transmission irregular trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6871012)