
doi: 10.1155/2014/785084
In 2012, Abdo and Dimitrov defined the total irregularity of a graphG=(V,E)asirrtG=1/2∑u,v∈VdGu-dGv, wheredGudenotes the vertex degree of a vertexu∈V. In this paper, we investigate the total irregularity of bicyclic graphs and characterize the graph with the maximal total irregularity among all bicyclic graphs onnvertices.
Extremal problems in graph theory, QA1-939, Vertex degrees, Mathematics
Extremal problems in graph theory, QA1-939, Vertex degrees, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 12 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
