Yet More Elementary Proof of Matrix-Tree Theorem for Signed Graphs

IF 0.4 4区 数学 Q4 MATHEMATICS
Shu Li, Jianfeng Wang
{"title":"Yet More Elementary Proof of Matrix-Tree Theorem for Signed Graphs","authors":"Shu Li, Jianfeng Wang","doi":"10.1142/s1005386723000408","DOIUrl":null,"url":null,"abstract":"A signed graph [Formula: see text] is a graph [Formula: see text] with vertex set [Formula: see text] and edge set [Formula: see text], together with a function [Formula: see text] assigning a positive or negative sign to each edge. In this paper, we present a more elementary proof for the matrix-tree theorem of signed graphs, which is based on the relations between the incidence matrices and the Laplcians of signed graphs. As an application, we also obtain the results of Monfared and Mallik about the matrix-tree theorem of graphs for signless Laplacians.","PeriodicalId":50958,"journal":{"name":"Algebra Colloquium","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebra Colloquium","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1142/s1005386723000408","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A signed graph [Formula: see text] is a graph [Formula: see text] with vertex set [Formula: see text] and edge set [Formula: see text], together with a function [Formula: see text] assigning a positive or negative sign to each edge. In this paper, we present a more elementary proof for the matrix-tree theorem of signed graphs, which is based on the relations between the incidence matrices and the Laplcians of signed graphs. As an application, we also obtain the results of Monfared and Mallik about the matrix-tree theorem of graphs for signless Laplacians.
符号图矩阵树定理的再初等证明
带符号图[公式:见文]是一个具有顶点集[公式:见文]和边集[公式:见文]的图[公式:见文],以及为每条边赋正号或负号的函数[公式:见文]。本文从关联矩阵与符号图的拉普拉斯定理的关系出发,给出了符号图的矩阵树定理的一个较为初等的证明。作为应用,我们也得到了monhad和Mallik关于无符号拉普拉斯图的矩阵树定理的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Algebra Colloquium
Algebra Colloquium 数学-数学
CiteScore
0.60
自引率
0.00%
发文量
625
审稿时长
15.6 months
期刊介绍: Algebra Colloquium is an international mathematical journal founded at the beginning of 1994. It is edited by the Academy of Mathematics & Systems Science, Chinese Academy of Sciences, jointly with Suzhou University, and published quarterly in English in every March, June, September and December. Algebra Colloquium carries original research articles of high level in the field of pure and applied algebra. Papers from related areas which have applications to algebra are also considered for publication. This journal aims to reflect the latest developments in algebra and promote international academic exchanges.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信