A Characterization of Graphs of Diameter Two-Reference-Cited by-同舟云学术

A Characterization of Graphs of Diameter Two

Published:1988-01 Issue:1 Volume:95 Page:37-38
ISSN:0002-9890
Container-title:The American Mathematical Monthly
language:en
Short-container-title:The American Mathematical Monthly

Author:

Bloom Gary S.¹,Kennedy John W.²,Quintas Louis V.²

Affiliation:

1. Computer Science Department, City College, CUNY, New York, NY 10031

2. Mathematics Department, Pace University, New York, NY 10038

Publisher

Informa UK Limited

Subject

General Mathematics

Link

https://www.tandfonline.com/doi/pdf/10.1080/00029890.1988.11971962

Reference3 articles.

1. D. Bauer, G. S. Bloom, and F. Boesch, Edge to Point Degree Lists and Triangle Free Point Degree Regular Graphs, pp. 93–104 in Progress in Graph Theory, J. A. Bondy and U. S. R. Murty (eds.), Academic Press, Toronto. 1984.

2. G. S. Bloom. J. W. Kennedy, and L. V. Quintas, Distance Degree Regular Graphs, pp. 95–108 in Theory and Applications of Graphs, G. Chartrand et al. (eds.), John Wiley & Sons, New York, 1981.

3. J. Bosák, A. Rosa, and S. Znám, On Decompositions of Complete Graphs into Factors With Given Diameters, pp. 37–56 in Theory of Graphs. P. Erdös and G. Katona (eds.), Academic Press. New-York. 1968.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Steiner 3-diameter, maximum degree and size of a graph;International Journal of Computer Mathematics: Computer Systems Theory;2022-02-18

2. Characterizing 2-distance graphs;Asian-European Journal of Mathematics;2019-02

3. On the Steiner 4-Diameter of Graphs;Journal of Interconnection Networks;2018-03

4. A note on the Steiner -diameter of a graph;International Journal of Computer Mathematics: Computer Systems Theory;2018-01-02