Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-23T06:18:31.745Z Has data issue: false hasContentIssue false
  • English
  • Français

Self 2-distance Graphs

Published online by Cambridge University Press:  20 November 2018

Ali Azimi  and
Mohammad Farrokhi Derakhshandeh Ghouchan
Ali Azimi
Affiliation:
Department of Mathematics, University of Neyshabur, P. O. Box 91136-899, Neyshabur, Iran e-mail: [email protected]
Mohammad Farrokhi Derakhshandeh Ghouchan
Affiliation:
Mathematical Science Research Unit, College of Liberal Arts, Muroran Institute of Technology, 27-1, Mizumoto, Muroran 050-8585, Hokkaido, Japan e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

All finite simple self 2-distance graphs with no square, diamond, or triangles with a common vertex as subgraph are determined. Utilizing these results, it is shown that there is no cubic self 2-distance graph.

Keywords

05C1205C6005C76distance graphregular graphforbidden subgraph
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 60 , Issue 1 , 01 March 2017 , pp. 26 - 42
Copyright
Copyright © Canadian Mathematical Society 2017

References

[1] Azimi, A. and Farrokhi, M. D. G., Simple graphs whose 2-distance graphs are paths or cycles. Matematiche (Catania) 69(2014), no. 2,183-191.Google Scholar
[2] Chilakamarri, K. B., The unit-distance graph problem: a brief survey and some new results. Bull. Inst. Combin. Appl. 8(1993), 39–60.Google Scholar
[3] Eggleton, R. B., P. Erdôs, and Skilton, D. K., Colouring the real line. J. Combin. Theory, Ser. B 39(1985), no. 1, 86–100. http://dx.doi.Org/10.101 6/0095-8956(85)90039-5 Google Scholar
[4] Hadwiger, H., Debrunner, H., and Klee, V., Combinatorial geometry in the plane. Holt, Rinehart and Winston, New York, 1964.Google Scholar
[5] Kramer, F. and Kramer, H., A survey on the distance-colouring of graphs. Discrete Math. 308(2008), no. 2-3, 422–426. http://dx.doi.Org/10.1 01 6/j.disc.2006.11.059 Google Scholar
[6] Liu, D. D., From rainbow to the lonely runner: a survey on coloring parameters of distance graphs. Taiwanese J. Math. 12(2008), no. 4, 851–871.Google Scholar
[7] Moser, L. and W. Moser, Solution to problem 10. Canad. Math. Bull. 4(1961), 187–189.Google Scholar
[8] Seidel, J. J., A survey of two-graphs. In: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Atti dei Convegni Lincei, 17, Acad. Naz. Lincei, Rome, 1976, pp. 481–511.Google Scholar
[9] Simic, S. K., Graph equations for line graphs and n-distance graphs. Publ. Inst. Math. (Beograd) 33(47)(1983), 203–216.Google Scholar
[10] Soifer, A., The mathematical coloring book: mathematics of coloring and the colorful life of its creators. Springer, New York, 2009.Google Scholar