Induced star-triangle factors of graphs-Reference-Cited by-同舟云学术

Induced star-triangle factors of graphs

Published:2021-08-01 Issue:1 Volume:13 Page:209-216
ISSN:2066-7752
Container-title:Acta Universitatis Sapientiae, Mathematica
language:en
Short-container-title:

Author:

Kainth S. P. S.¹,Kumar R.²,Pirzada S.³

Affiliation:

1. Department of Mathematics , Panjab University , Chandigarh , India

2. Punjab State Power Corporation Limited , Amritsar , India

3. Department of Mathematics , University of Kashmir , Srinagar , India

Abstract

Abstract An induced star-triangle factor of a graph G is a spanning subgraph F of G such that each component of F is an induced subgraph on the vertex set of that component and each component of F is a star (here star means either K1,n, n ≥ 2 or K2) or a triangle (cycle of length 3) in G. In this paper, we establish that every graph without isolated vertices admits an induced star-triangle factor in which any two leaves from different stars K1,n (n ≥ 2) are non-adjacent.

Publisher

Walter de Gruyter GmbH

Subject

General Mathematics

Link

https://www.sciendo.com/pdf/10.2478/ausm-2021-0012

Reference8 articles.

1. [1] J. Akiyama and M. Kano, Factors and factorizations of graphs, Lecture Notes in Math., 2031 Springer, 2011.

2. [2] A. Amahashi and M. Kano, On factors with given components, Discrete Math., 42 (1983), 1–6.

3. [3] C. Berge and M. Las Vergnas, On the existence of subgraphs with degree constraints, Nederl. Akad. Wetensch. Indag. Math., 40 (1978), 165–170.

4. [4] Y. Egawa, M. Kano and Z. Yan, Star-cycle factors of graphs, Discussiones Mathematicae Graph Theory, 34 (2014), 193–198.

5. [5] R. Kumar and S. P. Singh, SIG-dimension conjecture proved for graphs having a perfect matching, Discrete Math. Algorithms Appl., 9,1 (2017), 1750008 (24 pages).