Counterexamples to randić's conjecture on distance degree sequences for trees
From MaRDI portal
Publication:3942976
DOI10.1002/jgt.3190060111zbMath0484.05031OpenAlexW2013925500WikidataQ123352236 ScholiaQ123352236MaRDI QIDQ3942976
Publication date: 1982
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190060111
Related Items (13)
Proximity, remoteness and distance eigenvalues of a graph ⋮ Iterated joining of rooted trees ⋮ On the Characteristic Equations of the Characteristic Polynomial ⋮ Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs ⋮ On second order degree of graphs ⋮ Graphs and degree sequences. I ⋮ Joining caterpillars and stability of the tree center ⋮ Spiders are status unique in trees ⋮ On the distance distribution of trees ⋮ Cubic graphs without cut-vertices having the same path layer matrix ⋮ Distance degree regular graphs and distance degree injective graphs: an overview ⋮ Pairs of a tree and a nontree graph with the same status sequence ⋮ Proximity, remoteness and girth in graphs
This page was built for publication: Counterexamples to randić's conjecture on distance degree sequences for trees
