Simple graphs whose 2-distance graphs are path or cycle

Authors

  • Ali Azimi Ferdowsi University of Mashhad
  • Mohammad Farrokhi Derakhshandeh Ghouchan Ferdowsi University of Mashhad

Keywords:

Distance graph‎, ‎path‎, ‎cycle

Abstract

‎We will classify all finite simple graphs whose 2-distance graph have large or small maximum valency‎, ‎specially when it is a path or a cycle‎.

Author Biographies

  • Ali Azimi, Ferdowsi University of Mashhad
    Department of Pure Mathematics
  • Mohammad Farrokhi Derakhshandeh Ghouchan, Ferdowsi University of Mashhad
    Department of Pure Mathematics

Downloads

Published

2014-10-13

Issue

Vol. 69 No. 2 (2014)

Section

Articoli

License

The authors retain all rights to the original work without any restrictions.

License for Published Contents

Licenza Creative Commons

"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).

Licence scheme | Legal code

License for Metadata

"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

Licence scheme | Legal code

No Fee Charging

No fee is required to complete the submission/review/publishing process of authors paper.