Simple graphs whose 2-distance graphs are path or cycle
<p>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.</p>
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
2014-10-01
|
| Series: | Le Matematiche |
| Subjects: | |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/1079 |