几类完美图的Padmakar-Ivan指数

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2022-04-18 DOI:10.47443/dml.2021.s215

Manju Sankaramalil Chithrabhanu, K. Somasundaram

{"title":"几类完美图的Padmakar-Ivan指数","authors":"Manju Sankaramalil Chithrabhanu, K. Somasundaram","doi":"10.47443/dml.2021.s215","DOIUrl":null,"url":null,"abstract":"The Padmakar-Ivan (PI) index of a graph G is deﬁned as PI ( G ) = (cid:80) e ∈ E ( G ) ( | V ( G ) | − N G ( e )) , where N G ( e ) is the number of equidistant vertices for the edge e . A graph is perfect if for every induced subgraph H , the equation χ ( H ) = ω ( H ) holds, where χ ( H ) is the chromatic number and ω ( H ) is the size of a maximum clique of H . In this paper, the PI index of some types of perfect graphs is obtained. These types include co-bipartite graphs, line graphs, and prismatic graphs.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Padmakar-Ivan Index of Some Types of Perfect Graphs\",\"authors\":\"Manju Sankaramalil Chithrabhanu, K. Somasundaram\",\"doi\":\"10.47443/dml.2021.s215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Padmakar-Ivan (PI) index of a graph G is deﬁned as PI ( G ) = (cid:80) e ∈ E ( G ) ( | V ( G ) | − N G ( e )) , where N G ( e ) is the number of equidistant vertices for the edge e . A graph is perfect if for every induced subgraph H , the equation χ ( H ) = ω ( H ) holds, where χ ( H ) is the chromatic number and ω ( H ) is the size of a maximum clique of H . In this paper, the PI index of some types of perfect graphs is obtained. These types include co-bipartite graphs, line graphs, and prismatic graphs.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2021.s215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2021.s215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 2

摘要

图G的Padmakar-Ivan（PI）指数定义为PI（G）=（cid:80）e∈e（G）（|V（G）|−NG（e）），其中NG（e）是边e的等距顶点数。一个图是完美的，如果对于每个诱导子图H，方程χ（H）=ω（H）成立，其中χ（H）是色数，ω（H）为H的最大团的大小。本文得到了一些类型的完全图的PI指数。这些类型包括共二部图、线图和棱柱图。

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

查看原文本刊更多论文

Padmakar-Ivan Index of Some Types of Perfect Graphs

The Padmakar-Ivan (PI) index of a graph G is deﬁned as PI ( G ) = (cid:80) e ∈ E ( G ) ( | V ( G ) | − N G ( e )) , where N G ( e ) is the number of equidistant vertices for the edge e . A graph is perfect if for every induced subgraph H , the equation χ ( H ) = ω ( H ) holds, where χ ( H ) is the chromatic number and ω ( H ) is the size of a maximum clique of H . In this paper, the PI index of some types of perfect graphs is obtained. These types include co-bipartite graphs, line graphs, and prismatic graphs.

求助全文

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

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks