A study on the pendant number of graph products

IF 0.3 Q4 COMPUTER SCIENCE, THEORY & METHODS Acta Universitatis Sapientiae Informatica Pub Date : 2019-08-01 DOI:10.2478/ausi-2019-0002
J. Sebastian, J. V. Kureethara, S. Naduvath, C. Dominic
{"title":"A study on the pendant number of graph products","authors":"J. Sebastian, J. V. Kureethara, S. Naduvath, C. Dominic","doi":"10.2478/ausi-2019-0002","DOIUrl":null,"url":null,"abstract":"Abstract A path decomposition of a graph is a collection of its edge disjoint paths whose union is G. The pendant number Πp is the minimum number of end vertices of paths in a path decomposition of G. In this paper, we determine the pendant number of corona products and rooted products of paths and cycles and obtain some bounds for the pendant number for some specific derived graphs. Further, for any natural number n, the existence of a connected graph with pendant number n has also been established.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"16 1","pages":"24 - 40"},"PeriodicalIF":0.3000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Universitatis Sapientiae Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausi-2019-0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract A path decomposition of a graph is a collection of its edge disjoint paths whose union is G. The pendant number Πp is the minimum number of end vertices of paths in a path decomposition of G. In this paper, we determine the pendant number of corona products and rooted products of paths and cycles and obtain some bounds for the pendant number for some specific derived graphs. Further, for any natural number n, the existence of a connected graph with pendant number n has also been established.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
图积的垂数研究
图的路径分解是图的边不相交路径的集合,这些边不相交路径的并集为g。其中垂结点Πp是g的路径分解中路径端点的最小个数。本文确定了路径和环的冕积和根积的垂结点个数,并对某些特定的派生图得到了垂结点个数的界。进一步地,对于任意自然数n,也建立了一个垂数为n的连通图的存在性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Acta Universitatis Sapientiae Informatica
Acta Universitatis Sapientiae Informatica COMPUTER SCIENCE, THEORY & METHODS-
自引率
0.00%
发文量
9
期刊最新文献
E-super arithmetic graceful labelling of Hi(m, m), Hi(1) (m, m) and chain of even cycles On agglomeration-based rupture degree in networks and a heuristic algorithm On domination in signed graphs Connected certified domination edge critical and stable graphs Eccentric connectivity index in transformation graph Gxy+
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1