Which numbers are status differences?
From MaRDI portal
Publication:2242632
DOI10.1016/j.amc.2021.126004OpenAlexW3128841392MaRDI QIDQ2242632
Publication date: 10 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126004
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Distance in graphs (05C12)
Related Items
On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs, Status connectivity indices of line graphs, Minimum status of trees with a given degree sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results on average subtree density of series-reduced trees
- Polynomially solvable special cases of the quadratic bottleneck assignment problem
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- Infinite family of transmission irregular trees of even order
- Proximity, remoteness and girth in graphs
- Minimum statuses of connected graphs with fixed maximum degree and order
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees
- Infinite family of 2-connected transmission irregular graphs
- Distance spectra of graphs: a survey
- Stepwise transmission irregular graphs
- Equal opportunity networks, distance-balanced graphs, and Wiener game
- Proximity, remoteness and minimum degree
- Convex median and anti-median at prescribed distance
- Network descriptors based on betweenness centrality and transmission and their extremal values
- The median problem on \(k\)-partite graphs
- The centrality index of a graph
- Proximity and remoteness in graphs: Results and conjectures
- On the sum of all distances in a graph or digraph
- Distance in graphs
- Remoteness, proximity and few other distance invariants in graphs
- On the Addressing Problem for Loop Switching
