2014
DOI: 10.7151/dmgt.1733
|View full text |Cite
|
Sign up to set email alerts
|

The irregularity of graphs under graph operations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
19
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 39 publications
(22 citation statements)
references
References 12 publications
1
19
0
Order By: Relevance
“…The results presented in this paper complement the results from [3]. Here we consider the total irregularity of simple undirected graphs under several graph operations.…”
Section: Resultssupporting
confidence: 73%
See 1 more Smart Citation
“…The results presented in this paper complement the results from [3]. Here we consider the total irregularity of simple undirected graphs under several graph operations.…”
Section: Resultssupporting
confidence: 73%
“…Moreover, if G is a tree, then it was shown that irr t (G) ≤ (n − 2) irr(G). A lot of researches on irregularity of graphs have been carried out recently [2,3,7]. In this work we investigate the change of the total irregularity under different graph operations.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, Abdo et al introduced the new term "total irregularity measure of a graph G", which is defined as IRR t (G) � 1/2 UV∈E |d u − d v | [34][35][36]. Recently, Gutman introduced the IRF(G) irregularity index of the graph G, which is described as IRF(G) � UV∈E (d u − d v ) 2 in [37].…”
Section: Preliminaries and Notationsmentioning
confidence: 99%
“…Let V = V (P n ) = V (C ′ n ) and let B be an adjacency basis of P n . Since for two different vertices x, y ∈ V , d C ′ n ,2 (x, y) = d Pn,2 (x, y) if and only if x, y ∈ {v 1…”
Section: Lemma 12mentioning
confidence: 99%