Abstract
The distance distribution (dd) of a connected graph of diameter k is (D1,D2,...,Dk), where Di is the number of pairs of vertices at distance i from one another. The common neighbor distribution (nd) is (n0,n1,n2,...,nn–2), where ni is the number of pairs of vertices having i common neighbors. These and other sequences have been introduced recently as tools in distinguishing pairs of nonisomorphic graphs (dd(G) works best for graphs of large diameter; whereas, nd(G) is more useful for graphs of small diameter). They have also been used to study structural similarity in graphs sharing a common sequence.
If G has large diameter, its complement 0000123 has small diameter. In this paper, we use the concept of dominating sets to characterize graphs for which dd(G)=dd(0000123), and graphs for which nd(G)=nd(0000123). In the final section, we introduce a new graphical distribution being studied by Capobianco. He defines the geodesic distribution (gd) of a connected graph as (g1,g2,g3,...), where gi is the number of pairs of vertices having i shortest paths (geodesics) between them. We discuss gd(G) and examine its relationships to dd(G) and nd(G).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Akiyama, K. Ando, and D. Avis, Miscellaneous properties of equieccentric graphs. (submitted for publication).
M. Behzad and J. E. Simpson, Eccentric sequences and eccentric sets in graphs. Discrete Math. 16 (1976), 187–193.
G. S. Bloom, J. W. Kennedy, and L. V. Quintas, Distance degree regular graphs. The Theory and Applications of Graphs, G. Chartrand, et al., ed., Wiley, New York (1981), 95–108.
G. S. Bloom, J. W. Kennedy, and L. V. Quintas, Some problems concerning distance and path degree sequences. Proceedings of the Graph Theory Conference dedicated to the memory of Prof. K. Kuratowski, Łagow, Poland, 1981 (to appear).
F. Buckley, Self-centered graphs with a given radius. Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, F. Hoffman, et al., ed., Utilitas Mathematica, Winnipeg (1979), 211–215.
F. Buckley, Mean distance in line graphs. Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory, and Computing, F. Hoffman, et al., ed., Utilitas Mathematica, Winnipeg (1981), 153–162.
F. Buckley, The common neighbor distribution of a graph. Proceedings of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, F. Hoffman, et al., ed., Utilitas Mathematica, Winnipeg (to appear).
F. Buckley, Z. Miller and P. J. Slater, On graphs containing a given graph as center. J. Graph Theory 5 (1981), 427–434.
F. Buckley and L. Superville, Distance distributions and mean distance problems. Proceedings of the Third Caribbean Conference on Combinatorics and Computing, C. C. Cadogan, ed., University of the West Indies, Barbados (1981), 67–76.
M. Capobianco (personal communication).
E. J. Cockayne and S. T. Hedetniemi, Towards a theory of domination in graphs. Networks 7 (1977), 247–261.
R. C. Entringer, D. E. Jackson, and D. A. Snyder, Distance in graphs. Czech. Math. J. 26 (1976), 283–296.
R. J. Faudree, C. C. Rousseau, and R. H. Schelp, Theory of path length distributions I. Discrete Math. 6 (1973), 35–52.
R. J. Faudree and R. H. Schelp, Various length paths in graphs. Theory and Applications of Graphs, Y. Alavi and D. R. Lick, ed., Lecture Notes in Math. 642, Springer (1978), 160–173.
S. L. Hakimi, On the realizability of a set of integers as degrees of the vertices of a linear graph I. J. Soc. Indust. Appl. Math. 10 (1962), 496–506.
J. W. Kennedy and L. V. Quintas, Extremal f-trees and embedding spaces for molecular graphs. Discrete Appl. Math. 5 (1983), 191–209.
R. Laskar and H. B. Walikar, On domination related concepts in graph theory. Combinatorics and Graph Theory (Proceedings, Calcutta 1980), S. B. Rao ed., Lecture Notes in Math. 885, Springer (1981), 308–320.
L. Lesniak, Eccentric sequences in graphs. Period. Math. Hung. 6 (1975), 287–293.
R. Nandakumar, On graphs having eccentricity-preserving spanning trees. (submitted for publication).
K. R. Parthasarathy and R. Nandakumar, Unique eccentric point graphs. (submitted for publication).
L. Pósa, A theorem concerning Hamilton lines. Magyar Tud. Akad. Mat. Kutato Int. Kozl 7 (1962), 225–226.
L. V. Quintas and P. J. Slater, Pairs of nonisomorphic graphs having the same path degree sequence. Match 12 (1981), 75–86.
S. B. Rao, A survey of the theory of potentially p-graphic and forcibly p-graphic degree sequences. Combinatorics and Graph Theory (Proceedings, Calcutta 1980), S. B. Rao, ed., Lecture Notes in Math. 885, Springer (1981), 417–440.
J. J. Seidel, Strongly regular graphs. Surveys in Combinatorics (Proceedings 7th British Comb. Conf.), B. Bollobas, ed., London Math. Soc. Lecture Note Series 38 (1979), 157–180.
P. J. Slater, Counterexamples to Randic's conjecture on distance degree sequences for trees. J. Graph Theory 6 (1982), 89–91.
P. J. Slater, The origin of extended degree sequences of graphs. Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory, and Computing, F. Hoffman, et al., ed., Utilitas Mathematica, Winnipeg (1981), 309–320.
C. Thomassen, Counterexamples to Faudree and Schelp's conjecture on Hamiltonian-connected graphs. J. Graph Theory 2 (1978), 341–347.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Buckley, F. (1984). Equalities involving certain graphical distributions. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073116
Download citation
DOI: https://doi.org/10.1007/BFb0073116
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13368-1
Online ISBN: 978-3-540-38924-8
eBook Packages: Springer Book Archive