$Kite_{p+2,p}$由其拉普拉斯谱确定

IF 0.6 Q3 MATHEMATICS Transactions on Combinatorics Pub Date : 2021-09-01 DOI:10.22108/TOC.2021.126646.1798
H. Topcu
{"title":"$Kite_{p+2,p}$由其拉普拉斯谱确定","authors":"H. Topcu","doi":"10.22108/TOC.2021.126646.1798","DOIUrl":null,"url":null,"abstract":"$Kite_{n,p}$ denotes the kite graph that is obtained by appending complete graph with order $pgeq4$ to an endpoint of path graph with order $n-p$‎. ‎It is shown that $Kite_{n,p}$ is determined by its adjacency spectrum for all $p$ and $n$ [H‎. ‎Topcu and ‎S‎. ‎Sorgun‎, ‎The kite graph is determined by its adjacency spectrum‎, ‎Applied Math‎. ‎and Comp.‎, ‎330 (2018) 134--142]‎. ‎For $n-p=1$‎, ‎it is proven that $Kite_{n,p}$ is determined by its signless Laplacian spectrum when $ngeq4$‎, ‎$nneq5$ and is also determined by its distance spectrum when $ngeq4$ [K‎. ‎C‎. ‎Das and ‎M‎. ‎Liu‎, ‎Kite graphs are determined by their spectra‎, ‎Applied Math‎. ‎and Comp.‎, ‎297 (2017) 74--78]‎. ‎In this note‎, ‎we say that $Kite_{n,p}$ is determined by its Laplacian spectrum for $n-pleq2$‎.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"10 1","pages":"165-170"},"PeriodicalIF":0.6000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"$Kite_{p+2,p}$ is determined by its Laplacian spectrum\",\"authors\":\"H. Topcu\",\"doi\":\"10.22108/TOC.2021.126646.1798\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"$Kite_{n,p}$ denotes the kite graph that is obtained by appending complete graph with order $pgeq4$ to an endpoint of path graph with order $n-p$‎. ‎It is shown that $Kite_{n,p}$ is determined by its adjacency spectrum for all $p$ and $n$ [H‎. ‎Topcu and ‎S‎. ‎Sorgun‎, ‎The kite graph is determined by its adjacency spectrum‎, ‎Applied Math‎. ‎and Comp.‎, ‎330 (2018) 134--142]‎. ‎For $n-p=1$‎, ‎it is proven that $Kite_{n,p}$ is determined by its signless Laplacian spectrum when $ngeq4$‎, ‎$nneq5$ and is also determined by its distance spectrum when $ngeq4$ [K‎. ‎C‎. ‎Das and ‎M‎. ‎Liu‎, ‎Kite graphs are determined by their spectra‎, ‎Applied Math‎. ‎and Comp.‎, ‎297 (2017) 74--78]‎. ‎In this note‎, ‎we say that $Kite_{n,p}$ is determined by its Laplacian spectrum for $n-pleq2$‎.\",\"PeriodicalId\":43837,\"journal\":{\"name\":\"Transactions on Combinatorics\",\"volume\":\"10 1\",\"pages\":\"165-170\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2021-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2021.126646.1798\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2021.126646.1798","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

$Kite_{n.p}$表示通过将阶为$pgeq4-dollar的完全图附加到阶为$n-p的路径图的端点而获得的风筝图$结果表明,对于所有$p和$n$[H]-Topcu和S.Sorgun,$Kite_{n.p}$是由其相邻谱确定的。风筝图是由其邻近谱确定的,应用数学;以及Comp.,330°(2018)134-142]。当$n-p=1美元时,证明了$Kite_{n.p}$在$ngeq4$$nneq5$s时由其无符号拉普拉斯谱确定,在$angeq4$[K]时也由其距离谱确定;--Das和M;Liu,Kite图由其谱确定,应用数学;以及Comp.297×(2017)74-78]。在这个注释中,我们说$Kite_{n.p}$是由$n-pleq2$的拉普拉斯谱确定的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
$Kite_{p+2,p}$ is determined by its Laplacian spectrum
$Kite_{n,p}$ denotes the kite graph that is obtained by appending complete graph with order $pgeq4$ to an endpoint of path graph with order $n-p$‎. ‎It is shown that $Kite_{n,p}$ is determined by its adjacency spectrum for all $p$ and $n$ [H‎. ‎Topcu and ‎S‎. ‎Sorgun‎, ‎The kite graph is determined by its adjacency spectrum‎, ‎Applied Math‎. ‎and Comp.‎, ‎330 (2018) 134--142]‎. ‎For $n-p=1$‎, ‎it is proven that $Kite_{n,p}$ is determined by its signless Laplacian spectrum when $ngeq4$‎, ‎$nneq5$ and is also determined by its distance spectrum when $ngeq4$ [K‎. ‎C‎. ‎Das and ‎M‎. ‎Liu‎, ‎Kite graphs are determined by their spectra‎, ‎Applied Math‎. ‎and Comp.‎, ‎297 (2017) 74--78]‎. ‎In this note‎, ‎we say that $Kite_{n,p}$ is determined by its Laplacian spectrum for $n-pleq2$‎.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.80
自引率
0.00%
发文量
2
审稿时长
30 weeks
期刊最新文献
$Kite_{p+2,p}$ is determined by its Laplacian spectrum Certain classes of complementary equienergetic graphs On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs Exponential second Zagreb index of chemical trees The $a$-number of jacobians of certain maximal curves
×
引用
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