{"title":"关于星线图的一些结果","authors":"S. Varghese","doi":"10.37193/cmi.2022.02.12","DOIUrl":null,"url":null,"abstract":"\"Let $H$ be a connected graph with at least three vertices. The $H$-line graph, $HL(G)$, of a graph $G$ has all the edges of $G$ as its vertices, two vertices of $HL(G)$ are adjacent if the corresponding edges in $G$ are adjacent and belong to a common copy of $H$. In this paper we investigate some properties of the star-line graph $K_{1,n}L(G)$ of a graph $G$. We also obtain a Krausz type characterization for star-line graphs. Traversability of star-line graphs is also studied.\"","PeriodicalId":112946,"journal":{"name":"Creative Mathematics and Informatics","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some results on star-line graphs\",\"authors\":\"S. Varghese\",\"doi\":\"10.37193/cmi.2022.02.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\\"Let $H$ be a connected graph with at least three vertices. The $H$-line graph, $HL(G)$, of a graph $G$ has all the edges of $G$ as its vertices, two vertices of $HL(G)$ are adjacent if the corresponding edges in $G$ are adjacent and belong to a common copy of $H$. In this paper we investigate some properties of the star-line graph $K_{1,n}L(G)$ of a graph $G$. We also obtain a Krausz type characterization for star-line graphs. Traversability of star-line graphs is also studied.\\\"\",\"PeriodicalId\":112946,\"journal\":{\"name\":\"Creative Mathematics and Informatics\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Creative Mathematics and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37193/cmi.2022.02.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Creative Mathematics and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37193/cmi.2022.02.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
"Let $H$ be a connected graph with at least three vertices. The $H$-line graph, $HL(G)$, of a graph $G$ has all the edges of $G$ as its vertices, two vertices of $HL(G)$ are adjacent if the corresponding edges in $G$ are adjacent and belong to a common copy of $H$. In this paper we investigate some properties of the star-line graph $K_{1,n}L(G)$ of a graph $G$. We also obtain a Krausz type characterization for star-line graphs. Traversability of star-line graphs is also studied."
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
