Eccentric sequences in graphs

DOI10.1007/BF02017925MaRDI QIDQ1240256zbMATH OpenFDO

Authors Linda Lesniak

Publication date 1975

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02017925

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3377257 (Why is no real title available?)
• scientific article; zbMATH DE number 3194323 (Why is no real title available?)
• Selbstkomplementäre Graphen

Cited in

(32)

• Unique eccentric point graphs
• Eccentric sequences and eccentric sets in graphs
• Note on eccentricities in tournaments
• The eccentric weight of graphs
• Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
• Computing the eccentricity distribution of large graphs
• Constructing almost peripheral and almost self-centered graphs revisited
• Eccentric counts, connectivity and chordality
• Distance degree regular graphs and distance degree injective graphs: an overview
• Bounding the k-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
• On almost self-centered graphs and almost peripheral graphs
• Some extremal problems on the distance involving peripheral vertices of trees with given matching number
• Comparison between the non-self-centrality number and the total irregularity of graphs
• Vertex-weighted realizations of graphs
• On the eccentric complexity of graphs
• Relations between total irregularity and non-self-centrality of graphs
• Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs
• Upper bounds on the average eccentricity
• Distance in stratified graphs
• On the average of the eccentricities of a graph
• Efficiently realizing interval sequences
• scientific article; zbMATH DE number 2230268 (Why is no real title available?)
• Composed degree-distance realizations of graphs
• Realization problems on reachability sequences
• Composed degree-distance realizations of graphs
• Fault-tolerant graph realizations in the congested clique
• Temporal graph realization from fastest paths
• On subgraphs with prescribed eccentricities
• On the metric subgraphs of a graph
• Number of leaves vs. eccentric sequence in trees
• Realizing temporal transportation trees
• Nontraceable detour graphs

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)