Decomposing certain equipartite graphs into sunlet graphs of length 2p
For any integer r≥3, we define the sunlet graph of order 2r, denoted L2r, as the graph consisting of a cycle of length r together with r pendant vertices, each adjacent to exactly one vertex of the cycle. In this paper, we give necessary and sufficient conditions for decomposing the lexicographic pr...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2016-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S097286001630024X |