论图的艾伯森不规则测度

Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics Pub Date : 1900-01-01 DOI:10.5937/spsunp1902097m

M. Matejic, B. Mitić, E. Milovanovic, I. Milovanovic

{"title":"论图的艾伯森不规则测度","authors":"M. Matejic, B. Mitić, E. Milovanovic, I. Milovanovic","doi":"10.5937/spsunp1902097m","DOIUrl":null,"url":null,"abstract":"Let G = (V,E), V = {1,2, . . . ,n} be a simple connected graph with n vertices, m edges and a sequence of vertex degrees d1 ≥ d2 ≥ ·· · ≥ dn > 0, di = d(i). The irregularity measure of graph is defined as irr(G)=∑i∼ j ∣∣di −d j∣∣, where i∼ j denotes adjacency of vertices i and j. New upper bounds for irr(G) are obtained.","PeriodicalId":394770,"journal":{"name":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On Alberson irregularity measure of graphs\",\"authors\":\"M. Matejic, B. Mitić, E. Milovanovic, I. Milovanovic\",\"doi\":\"10.5937/spsunp1902097m\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G = (V,E), V = {1,2, . . . ,n} be a simple connected graph with n vertices, m edges and a sequence of vertex degrees d1 ≥ d2 ≥ ·· · ≥ dn > 0, di = d(i). The irregularity measure of graph is defined as irr(G)=∑i∼ j ∣∣di −d j∣∣, where i∼ j denotes adjacency of vertices i and j. New upper bounds for irr(G) are obtained.\",\"PeriodicalId\":394770,\"journal\":{\"name\":\"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5937/spsunp1902097m\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5937/spsunp1902097m","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

设G = (V,E)， V ={1,2，…，n}为具有n个顶点、m条边、顶点度数d1≥d2≥···≥dn > 0的简单连通图，di = d(i)。图的不规则度定义为irr(G)=∑i ~ j∣∣di−d j∣∣，其中i ~ j表示顶点i和j的邻接性。得到了irr(G)的新的上界。

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

查看原文本刊更多论文

On Alberson irregularity measure of graphs

Let G = (V,E), V = {1,2, . . . ,n} be a simple connected graph with n vertices, m edges and a sequence of vertex degrees d1 ≥ d2 ≥ ·· · ≥ dn > 0, di = d(i). The irregularity measure of graph is defined as irr(G)=∑i∼ j ∣∣di −d j∣∣, where i∼ j denotes adjacency of vertices i and j. New upper bounds for irr(G) are obtained.

求助全文

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

来源期刊

Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics

自引率

0.00%

发文量