Ostrander关于有向图拉普拉斯特征向量的三个猜想

Yaokun Wu, Da Zhao
{"title":"Ostrander关于有向图拉普拉斯特征向量的三个猜想","authors":"Yaokun Wu, Da Zhao","doi":"10.26493/2590-9770.1420.B57","DOIUrl":null,"url":null,"abstract":"Ostrander proposed three conjectures on the connections between topological properties of a weighted digraph and combinatorial properties of its Laplacian eigenvectors. We verify one of his conjectures, give counterexamples to the other two, and then seek for related valid connections and generalizations to Schrodinger operators on countable digraphs. We suggest the open question of deciding if the countability assumption can be dropped from our main results.","PeriodicalId":36246,"journal":{"name":"Art of Discrete and Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Three conjectures of Ostrander on digraph Laplacian eigenvectors\",\"authors\":\"Yaokun Wu, Da Zhao\",\"doi\":\"10.26493/2590-9770.1420.B57\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ostrander proposed three conjectures on the connections between topological properties of a weighted digraph and combinatorial properties of its Laplacian eigenvectors. We verify one of his conjectures, give counterexamples to the other two, and then seek for related valid connections and generalizations to Schrodinger operators on countable digraphs. We suggest the open question of deciding if the countability assumption can be dropped from our main results.\",\"PeriodicalId\":36246,\"journal\":{\"name\":\"Art of Discrete and Applied Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Art of Discrete and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26493/2590-9770.1420.B57\",\"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":"Art of Discrete and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/2590-9770.1420.B57","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

摘要

Ostrander对加权有向图的拓扑性质与其拉普拉斯特征向量的组合性质之间的联系提出了三个猜想。我们验证了他的一个猜想,给出了另外两个猜想的反例,然后寻求可数有向图上薛定谔算子的相关有效联系和推广。我们建议讨论一个悬而未决的问题,即是否可以从我们的主要结果中去掉可数假设。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Three conjectures of Ostrander on digraph Laplacian eigenvectors
Ostrander proposed three conjectures on the connections between topological properties of a weighted digraph and combinatorial properties of its Laplacian eigenvectors. We verify one of his conjectures, give counterexamples to the other two, and then seek for related valid connections and generalizations to Schrodinger operators on countable digraphs. We suggest the open question of deciding if the countability assumption can be dropped from our main results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Art of Discrete and Applied Mathematics
Art of Discrete and Applied Mathematics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
0.90
自引率
0.00%
发文量
43
期刊最新文献
Multipartite Ramsey number of complete graphs versus matchings Half-arc-transitive graphs of arbitrarily large girth Determinant identities for the Catalan, Motzkin and Schröder numbers On face-magic labelings of regular tesselations Graph labelings obtainable by random walks
×
引用
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