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

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete mathematics and theoretical computer science Ročník 16 no. 1; číslo Graph Theory; s. 201 - 206
Hlavní autoři:	Abdo, Hosam, Brandt, Stephan, Dimitrov, D.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Nancy DMTCS 01.01.2014 American Mathematical Society Discrete Mathematics & Theoretical Computer Science
Témata:	[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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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 element of V(G). All graphs with maximal total irregularity are determined. It is also shown that among all trees of the same order the star has the maximal total irregularity.
Bibliografie:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	1365-8050 1462-7264 1365-8050
DOI:	10.46298/dmtcs.1263