On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs
From MaRDI portal
Publication:2001612
DOI10.1016/j.amc.2018.01.039zbMath1427.05064OpenAlexW2791600477MaRDI QIDQ2001612
Publication date: 10 July 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.01.039
Related Items (18)
Infinite family of transmission irregular trees of even order ⋮ Comparing Wiener complexity with eccentric complexity ⋮ On interval transmission irregular graphs ⋮ On transmission irregular starlike trees ⋮ New transmission irregular chemical graphs ⋮ Further contributions on the outer multiset dimension of graphs ⋮ Constructing new families of transmission irregular graphs ⋮ Infinite family of 3-connected cubic transmission irregular graphs ⋮ On quartic transmission irregular graphs ⋮ Transmission in H-naphtalenic nanosheet ⋮ Infinite family of 2-connected transmission irregular graphs ⋮ On the difference of Mostar index and irregularity of graphs ⋮ Metric properties of generalized Sierpiński graphs over stars ⋮ Stepwise transmission irregular graphs ⋮ On the relation between Wiener index and eccentricity of a graph ⋮ On 2-Connected Transmission Irregular Graphs ⋮ General transmission lemma and Wiener complexity of triangular grids ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analytical expressions for Wiener indices of \(n\)-circumscribed peri-condensed benzenoid graphs
- Remoteness and distance eigenvalues of a graph
- Open quipus with the same Wiener index as their quadratic line graph
- Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond
- Wiener index of hexagonal systems
- Leapfrog fullerenes and Wiener index
- The Szeged index and the Wiener index of partial cubes with applications to chemical graphs
- Wiener index, Harary index and graph properties
- Computing median and antimedian sets in median graphs
- On the Wiener index, distance cospectrality and transmission-regular graphs
- The Wiener index of \(r\)-uniform hypergraphs
- Complete solution of equation \(W(L^3(T))=W(T)\) for the Wiener index of iterated line graphs of trees
- Centralization of transmission in networks
- Mathematical aspects of Wiener index
- On the sum of all distances in a graph or digraph
- Distance in graphs
- Wiener index, Harary index and Hamiltonicity of graphs
- The Wiener Index of Random Digital Trees
- Asymmetric graphs
- Wiener index of trees: Theory and applications
This page was built for publication: On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs