Graphs whose line graphs are ring graphs
Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H i...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.10.002 |
| id |
doaj-80328ae920e744d291bf5b32d6b777be |
|---|---|
| record_format |
Article |
| spelling |
doaj-80328ae920e744d291bf5b32d6b777be2020-12-17T17:28:38ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742020-09-0117380180310.1016/j.akcej.2019.10.0021738882Graphs whose line graphs are ring graphsMahdi Reza Khorsandi0Shahrood University of TechnologyGiven a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H in the previous step in two adjacent vertices. In this article, we classify all graphs whose line graphs and total graphs are ring graphs.http://dx.doi.org/10.1016/j.akcej.2019.10.002ring graphline graphtotal graph |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Mahdi Reza Khorsandi |
| spellingShingle |
Mahdi Reza Khorsandi Graphs whose line graphs are ring graphs AKCE International Journal of Graphs and Combinatorics ring graph line graph total graph |
| author_facet |
Mahdi Reza Khorsandi |
| author_sort |
Mahdi Reza Khorsandi |
| title |
Graphs whose line graphs are ring graphs |
| title_short |
Graphs whose line graphs are ring graphs |
| title_full |
Graphs whose line graphs are ring graphs |
| title_fullStr |
Graphs whose line graphs are ring graphs |
| title_full_unstemmed |
Graphs whose line graphs are ring graphs |
| title_sort |
graphs whose line graphs are ring graphs |
| publisher |
Taylor & Francis Group |
| series |
AKCE International Journal of Graphs and Combinatorics |
| issn |
0972-8600 2543-3474 |
| publishDate |
2020-09-01 |
| description |
Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H in the previous step in two adjacent vertices. In this article, we classify all graphs whose line graphs and total graphs are ring graphs. |
| topic |
ring graph line graph total graph |
| url |
http://dx.doi.org/10.1016/j.akcej.2019.10.002 |
| work_keys_str_mv |
AT mahdirezakhorsandi graphswhoselinegraphsareringgraphs |
| _version_ |
1724379130631290880 |