Eccentric sequences in graphs
From MaRDI portal
Cites work
Cited in
(27)- scientific article; zbMATH DE number 2230268 (Why is no real title available?)
- Fault-tolerant graph realizations in the congested clique
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- Some extremal problems on the distance involving peripheral vertices of trees with given matching number
- On the average of the eccentricities of a graph
- Distance degree regular graphs and distance degree injective graphs: an overview
- Constructing almost peripheral and almost self-centered graphs revisited
- Nontraceable detour graphs
- Distance in stratified graphs
- On the eccentric complexity of graphs
- Relations between total irregularity and non-self-centrality of graphs
- Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
- Computing the eccentricity distribution of large graphs
- Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs
- Eccentric sequences and eccentric sets in graphs
- Note on eccentricities in tournaments
- Realization problems on reachability sequences
- Vertex-weighted realizations of graphs
- Unique eccentric point graphs
- Eccentric counts, connectivity and chordality
- On almost self-centered graphs and almost peripheral graphs
- Upper bounds on the average eccentricity
- The eccentric weight of graphs
- Composed degree-distance realizations of graphs
- Composed degree-distance realizations of graphs
- Comparison between the non-self-centrality number and the total irregularity of graphs
- Efficiently realizing interval sequences
This page was built for publication: Eccentric sequences in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1240256)
