关于G_{m,n}图的一些结构性质

Ivy Chakrabarty
{"title":"关于G_{m,n}图的一些结构性质","authors":"Ivy Chakrabarty","doi":"10.12723/mjs.50.4","DOIUrl":null,"url":null,"abstract":"This is the continuation of the study on an undirected graph $G_{m,n}$ where vertex set $V=I_n=\\{1,2,3,\\cdots,n\\}$ and $a,b\\in V$ are adjacent if and only if $a\\neq b$ and $a+b$ is not divisible by $m$, where $m(>1)\\in \\mathbb{N}$. In the present paper we computed the diameter, Weiner index, degree distance, independence number of the graph $G_{m,n}$. We also studied the complement of the graph $G_{m,n}$.","PeriodicalId":18050,"journal":{"name":"Mapana Journal of Sciences","volume":"243 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Some Structural Properties of G_{m,n} Graphs\",\"authors\":\"Ivy Chakrabarty\",\"doi\":\"10.12723/mjs.50.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This is the continuation of the study on an undirected graph $G_{m,n}$ where vertex set $V=I_n=\\\\{1,2,3,\\\\cdots,n\\\\}$ and $a,b\\\\in V$ are adjacent if and only if $a\\\\neq b$ and $a+b$ is not divisible by $m$, where $m(>1)\\\\in \\\\mathbb{N}$. In the present paper we computed the diameter, Weiner index, degree distance, independence number of the graph $G_{m,n}$. We also studied the complement of the graph $G_{m,n}$.\",\"PeriodicalId\":18050,\"journal\":{\"name\":\"Mapana Journal of Sciences\",\"volume\":\"243 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mapana Journal of Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12723/mjs.50.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mapana Journal of Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12723/mjs.50.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文是对无向图$G_{m,n}$的继续研究,其中顶点集$V=I_n=\{1,2,3,\cdots,n\}$和$a,b\在V$中相邻当且仅当$a\neq b$和$a+b$不能被$m$整除,且$m(>1)\ \mathbb{n}$。本文计算了图$G_{m,n}$的直径、Weiner指数、度距离和独立数。我们还研究了图$G_{m,n}$的补。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Some Structural Properties of G_{m,n} Graphs
This is the continuation of the study on an undirected graph $G_{m,n}$ where vertex set $V=I_n=\{1,2,3,\cdots,n\}$ and $a,b\in V$ are adjacent if and only if $a\neq b$ and $a+b$ is not divisible by $m$, where $m(>1)\in \mathbb{N}$. In the present paper we computed the diameter, Weiner index, degree distance, independence number of the graph $G_{m,n}$. We also studied the complement of the graph $G_{m,n}$.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信