四元数单位增益图的左行秩与其底层图的秩之间的关系

IF 0.7 4区 数学 Q2 Mathematics Electronic Journal of Linear Algebra Pub Date : 2023-04-20 DOI:10.13001/ela.2023.7681
Qiannan Zhou, Yong Lu
{"title":"四元数单位增益图的左行秩与其底层图的秩之间的关系","authors":"Qiannan Zhou, Yong Lu","doi":"10.13001/ela.2023.7681","DOIUrl":null,"url":null,"abstract":"Let $\\Phi=(G,U(\\mathbb{Q}),\\varphi)$ be a quaternion unit gain graph (or $U(\\mathbb{Q})$-gain graph), where $G$ is the underlying graph of $\\Phi$, $U(\\mathbb{Q})=\\{z\\in \\mathbb{Q}: |z|=1\\}$ is the circle group, and $\\varphi:\\overrightarrow{E}\\rightarrow U(\\mathbb{Q})$ is the gain function such that $\\varphi(e_{ij})=\\varphi(e_{ji})^{-1}=\\overline{\\varphi(e_{ji})}$. Let $A(\\Phi)$ be the adjacency matrix of $\\Phi$ and $r(\\Phi)$ be the row left rank of $\\Phi$. In this paper, we prove that $-2c(G)\\leq r(\\Phi)-r(G)\\leq 2c(G)$, where $r(G)$ and $c(G)$ are the rank and the dimension of cycle space of $G$, respectively. All corresponding extremal graphs are characterized. The results will generalize the corresponding results of signed graphs (Lu et al. [20] and Wang [33]), mixed graphs (Chen et al. [7]), and complex unit gain graphs (Lu et al. [21]).","PeriodicalId":50540,"journal":{"name":"Electronic Journal of Linear Algebra","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Relation between the row left rank of a quaternion unit gain graph and the rank of its underlying graph\",\"authors\":\"Qiannan Zhou, Yong Lu\",\"doi\":\"10.13001/ela.2023.7681\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $\\\\Phi=(G,U(\\\\mathbb{Q}),\\\\varphi)$ be a quaternion unit gain graph (or $U(\\\\mathbb{Q})$-gain graph), where $G$ is the underlying graph of $\\\\Phi$, $U(\\\\mathbb{Q})=\\\\{z\\\\in \\\\mathbb{Q}: |z|=1\\\\}$ is the circle group, and $\\\\varphi:\\\\overrightarrow{E}\\\\rightarrow U(\\\\mathbb{Q})$ is the gain function such that $\\\\varphi(e_{ij})=\\\\varphi(e_{ji})^{-1}=\\\\overline{\\\\varphi(e_{ji})}$. Let $A(\\\\Phi)$ be the adjacency matrix of $\\\\Phi$ and $r(\\\\Phi)$ be the row left rank of $\\\\Phi$. In this paper, we prove that $-2c(G)\\\\leq r(\\\\Phi)-r(G)\\\\leq 2c(G)$, where $r(G)$ and $c(G)$ are the rank and the dimension of cycle space of $G$, respectively. All corresponding extremal graphs are characterized. The results will generalize the corresponding results of signed graphs (Lu et al. [20] and Wang [33]), mixed graphs (Chen et al. [7]), and complex unit gain graphs (Lu et al. [21]).\",\"PeriodicalId\":50540,\"journal\":{\"name\":\"Electronic Journal of Linear Algebra\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Linear Algebra\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.13001/ela.2023.7681\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Linear Algebra","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.13001/ela.2023.7681","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

摘要

设$\Phi=(G,U(\mathbb{Q}),\varphi)$为四元数单位增益图(或$U(\mathbb{Q})$ -增益图),其中$G$为$\Phi$的底层图,$U(\mathbb{Q})=\{z\in \mathbb{Q}: |z|=1\}$为圆组,$\varphi:\overrightarrow{E}\rightarrow U(\mathbb{Q})$为增益函数,使得$\varphi(e_{ij})=\varphi(e_{ji})^{-1}=\overline{\varphi(e_{ji})}$。设$A(\Phi)$为$\Phi$的邻接矩阵,$r(\Phi)$为$\Phi$的左行秩。本文证明了$-2c(G)\leq r(\Phi)-r(G)\leq 2c(G)$,其中$r(G)$和$c(G)$分别是$G$的循环空间的秩和维数。对所有相应的极值图进行了刻画。所得结果将推广符号图(Lu et al.[20]和Wang[33])、混合图(Chen et al.[7])和复单位增益图(Lu et al.[21])的相应结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Relation between the row left rank of a quaternion unit gain graph and the rank of its underlying graph
Let $\Phi=(G,U(\mathbb{Q}),\varphi)$ be a quaternion unit gain graph (or $U(\mathbb{Q})$-gain graph), where $G$ is the underlying graph of $\Phi$, $U(\mathbb{Q})=\{z\in \mathbb{Q}: |z|=1\}$ is the circle group, and $\varphi:\overrightarrow{E}\rightarrow U(\mathbb{Q})$ is the gain function such that $\varphi(e_{ij})=\varphi(e_{ji})^{-1}=\overline{\varphi(e_{ji})}$. Let $A(\Phi)$ be the adjacency matrix of $\Phi$ and $r(\Phi)$ be the row left rank of $\Phi$. In this paper, we prove that $-2c(G)\leq r(\Phi)-r(G)\leq 2c(G)$, where $r(G)$ and $c(G)$ are the rank and the dimension of cycle space of $G$, respectively. All corresponding extremal graphs are characterized. The results will generalize the corresponding results of signed graphs (Lu et al. [20] and Wang [33]), mixed graphs (Chen et al. [7]), and complex unit gain graphs (Lu et al. [21]).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.20
自引率
14.30%
发文量
45
审稿时长
6-12 weeks
期刊介绍: The journal is essentially unlimited by size. Therefore, we have no restrictions on length of articles. Articles are submitted electronically. Refereeing of articles is conventional and of high standards. Posting of articles is immediate following acceptance, processing and final production approval.
期刊最新文献
Diagonal-Schur complements of Nekrasov matrices The inverse of a symmetric nonnegative matrix can be copositive On condition numbers of quaternion matrix inverse and quaternion linear systems with multiple right-hand sides Unicyclic graphs and the inertia of the squared distance matrix Decompositions of matrices into a sum of invertible matrices and matrices of fixed nilpotence
×
引用
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