图的诱导星三角因子

Pub Date : 2021-08-01 DOI:10.2478/ausm-2021-0012

S. P. S. Kainth, R. Kumar, S. Pirzada

{"title":"图的诱导星三角因子","authors":"S. P. S. Kainth, R. Kumar, S. Pirzada","doi":"10.2478/ausm-2021-0012","DOIUrl":null,"url":null,"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.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Induced star-triangle factors of graphs\",\"authors\":\"S. P. S. Kainth, R. Kumar, S. Pirzada\",\"doi\":\"10.2478/ausm-2021-0012\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2021-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/ausm-2021-0012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausm-2021-0012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

文摘的诱导star-triangle因素图G是一个生成子图G的每个组件F是一个诱导子图的顶点集F是一个恒星的组件,每个组件(明星意味着要么K1, n, n≥2或K2)或一个三角形(周期长度3)G在本文中,我们建立,每个图没有孤立的顶点承认一个诱导star-triangle因素在其中任意两个不同的恒星K1, n (n≥2)是不相邻的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

Induced star-triangle factors of graphs

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助