关于图度偏差测度的一个猜想

arXiv: Combinatorics Pub Date : 2020-02-20 DOI:10.22108/TOC.2020.121737.1709

A. Ghalavand, A. Ashrafi

{"title":"关于图度偏差测度的一个猜想","authors":"A. Ghalavand, A. Ashrafi","doi":"10.22108/TOC.2020.121737.1709","DOIUrl":null,"url":null,"abstract":"Let G be an n-vertex graph with m edges. The degree deviation measure of G is defined as s(G)=sum v in V(G)|degG(v)-(2m/n)|, where n and m are the number of vertices and edges of G, respectively. The aim of this paper is to prove the Conjecture 4.2 of [J A de Oliveira, C S Oliveira, C Justel and N M Maia de Abreu, Measures of irregularity of graphs, Pesq. Oper. 33 (3) (2013) 383-398]. The degree deviation measure of chemical graphs under some conditions on the cyclomatic number is also computed.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":"49 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On a Conjecture about Degree Deviation Measure of Graphs\",\"authors\":\"A. Ghalavand, A. Ashrafi\",\"doi\":\"10.22108/TOC.2020.121737.1709\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be an n-vertex graph with m edges. The degree deviation measure of G is defined as s(G)=sum v in V(G)|degG(v)-(2m/n)|, where n and m are the number of vertices and edges of G, respectively. The aim of this paper is to prove the Conjecture 4.2 of [J A de Oliveira, C S Oliveira, C Justel and N M Maia de Abreu, Measures of irregularity of graphs, Pesq. Oper. 33 (3) (2013) 383-398]. The degree deviation measure of chemical graphs under some conditions on the cyclomatic number is also computed.\",\"PeriodicalId\":8442,\"journal\":{\"name\":\"arXiv: Combinatorics\",\"volume\":\"49 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2020.121737.1709\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2020.121737.1709","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

设G是一个有m条边的n顶点图。G的度偏差度量定义为s(G)=sum v in v (G)|degG(v)-(2m/n)|，其中n为G的顶点数，m为G的边数。本文的目的是证明J A de Oliveira, C S Oliveira, C Justel和N M Maia de Abreu的猜想4.2，图的不规则性度量，Pesq。卷33(3)(2013)383-398]。计算了化学图在一定条件下对圈数的度偏差测度。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On a Conjecture about Degree Deviation Measure of Graphs

Let G be an n-vertex graph with m edges. The degree deviation measure of G is defined as s(G)=sum v in V(G)|degG(v)-(2m/n)|, where n and m are the number of vertices and edges of G, respectively. The aim of this paper is to prove the Conjecture 4.2 of [J A de Oliveira, C S Oliveira, C Justel and N M Maia de Abreu, Measures of irregularity of graphs, Pesq. Oper. 33 (3) (2013) 383-398]. The degree deviation measure of chemical graphs under some conditions on the cyclomatic number is also computed.

求助全文

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

来源期刊

arXiv: Combinatorics

自引率

0.00%

发文量

期刊最新文献

Schubert Products for Permutations with Separated Descents. Explicit Formulas for the First Form (q,r)-Dowling Numbers and (q,r)-Whitney-Lah Numbers Tit-for-Tat Strategy as a Deformed Zero-Determinant Strategy in Repeated Games An inequality for coefficients of the real-rooted polynomials $\lambda$-Core Distance Partitions