The total irregularity of a graph

Graph Theory In this note a new measure of irregularity of a graph G is introduced. It is named the total irregularity of a graph and is defined as irr(t)(G) - 1/2 Sigma(u, v is an element of V(G)) vertical bar d(G)(u) - d(G)(v)vertical bar, where d(G)(u) denotes the degree of a vertex u is an eleme...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník 16 no. 1; číslo Graph Theory; s. 201 - 206
Hlavní autori:	Abdo, Hosam, Brandt, Stephan, Dimitrov, D.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Nancy DMTCS 01.01.2014 American Mathematical Society Discrete Mathematics & Theoretical Computer Science
Predmet:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Combinatorics Computer Science Discrete Mathematics Graphs the irregularity of a graph the total irregularity of a graph extremal graphs the irregularity of a graph the total irregularity of a graph extremal graphs
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!