k图无符号拉普拉斯矩阵谱半径的若干界

IF 1.8 4区管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Rairo-Operations Research Pub Date : 2023-07-19 DOI:10.1051/ro/2023109

Junhao Zhang, Zhongxun Zhu

{"title":"k图无符号拉普拉斯矩阵谱半径的若干界","authors":"Junhao Zhang, Zhongxun Zhu","doi":"10.1051/ro/2023109","DOIUrl":null,"url":null,"abstract":"For a $k$-graph $H=(V(H), E(H))$, let $B(H)$ be its incidence matrix, and $Q(H)=B(H)B(H)^T$ be its signless Laplacian matrix, this name comes from the fact that $Q(H)$ is exactly the well-known signless Laplacian matrix for $2$-graph. Define the largest eigenvalue $\\rho(H)$ of $Q(H)$ as the spectral radius of $H$. In this paper, we give some lower and upper bounds on $\\rho(H)$ by some structural parameters (such as independent number, maximum degree, minimum degree, diameter, and so on) of $H$, which are extend or improve some known results.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"16 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some bounds on spectral radius of signless Laplacian matrix of k-graphs\",\"authors\":\"Junhao Zhang, Zhongxun Zhu\",\"doi\":\"10.1051/ro/2023109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a $k$-graph $H=(V(H), E(H))$, let $B(H)$ be its incidence matrix, and $Q(H)=B(H)B(H)^T$ be its signless Laplacian matrix, this name comes from the fact that $Q(H)$ is exactly the well-known signless Laplacian matrix for $2$-graph. Define the largest eigenvalue $\\\\rho(H)$ of $Q(H)$ as the spectral radius of $H$. In this paper, we give some lower and upper bounds on $\\\\rho(H)$ by some structural parameters (such as independent number, maximum degree, minimum degree, diameter, and so on) of $H$, which are extend or improve some known results.\",\"PeriodicalId\":54509,\"journal\":{\"name\":\"Rairo-Operations Research\",\"volume\":\"16 1\",\"pages\":\"\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2023-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Rairo-Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2023109\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Rairo-Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1051/ro/2023109","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

对于一个$k$-图$H=(V(H)， E(H))$，设$B(H)$为它的关联矩阵，$Q(H)=B(H)B(H)^T$为它的无符号拉普拉斯矩阵，这个名字来源于$Q(H)$正是众所周知的$2$-图$的无符号拉普拉斯矩阵。定义Q(H)$的最大特征值$\rho(H)$作为$H$的谱半径。本文利用H$的一些结构参数(如独立数、最大度、最小度、直径等)给出了H$的下界和上界，推广或改进了一些已知的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Some bounds on spectral radius of signless Laplacian matrix of k-graphs

For a $k$-graph $H=(V(H), E(H))$, let $B(H)$ be its incidence matrix, and $Q(H)=B(H)B(H)^T$ be its signless Laplacian matrix, this name comes from the fact that $Q(H)$ is exactly the well-known signless Laplacian matrix for $2$-graph. Define the largest eigenvalue $\rho(H)$ of $Q(H)$ as the spectral radius of $H$. In this paper, we give some lower and upper bounds on $\rho(H)$ by some structural parameters (such as independent number, maximum degree, minimum degree, diameter, and so on) of $H$, which are extend or improve some known results.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Rairo-Operations Research 管理科学-运筹学与管理科学

CiteScore

3.60

自引率

22.20%

发文量

206

审稿时长

>12 weeks

期刊介绍： RAIRO-Operations Research is an international journal devoted to high-level pure and applied research on all aspects of operations research. All papers published in RAIRO-Operations Research are critically refereed according to international standards. Any paper will either be accepted (possibly with minor revisions) either submitted to another evaluation (after a major revision) or rejected. Every effort will be made by the Editorial Board to ensure a first answer concerning a submitted paper within three months, and a final decision in a period of time not exceeding six months.