发布求助
文献互助 智能选刊 最新文献

Research & Reviews: Discrete Mathematical Structures最新文献

筛选
英文 中文
On the Pendant Number of Some New Graph Classes 关于若干新图类的垂数
Research & Reviews: Discrete Mathematical Structures Pub Date : 2019-04-01 DOI: 10.37591/RRDMS.V6I1.1900
J. Sebastian, J. V. Kureethara, S. Naduvath, C. Dominic
{"title":"On the Pendant Number of Some New Graph Classes","authors":"J. Sebastian, J. V. Kureethara, S. Naduvath, C. Dominic","doi":"10.37591/RRDMS.V6I1.1900","DOIUrl":"https://doi.org/10.37591/RRDMS.V6I1.1900","url":null,"abstract":"Abstract A decomposition of a graph  is a collection of its edge disjoint sub-graphs such that their union is . If all the sub-graphs in the decomposition are paths, then it is a path decomposition. In this paper, we discuss the pendant number, the minimum number of end vertices of paths in a path decomposition of a graph. We also determine this parameter for some graph classes. Keywords: Decomposition, path decomposition, pendant number . MSC2010: 05C70, 05C38, 05C40 Cite this Article Jomon K. Sebastian, Joseph Varghese Kureethara, Sudev Naduvath, Charles Dominic. On the Pendant Number of Some New Graph Classes. Research & Reviews: Discrete Mathematical Structures . 2019; 6(1): 15–21p.","PeriodicalId":426140,"journal":{"name":"Research & Reviews: Discrete Mathematical Structures","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114434016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信