2006
DOI: 10.1007/bf02896401
|View full text |Cite
|
Sign up to set email alerts
|

A relationship between bounds on the sum of squares of degrees of a graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
9
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 5 publications
0
9
0
Order By: Relevance
“…More about (4) one can refer to [9,16,23,27,36,42]. Based on (4) in [19] a measure called Edwards irregularity measure was defined as…”
Section: It Is Not Difficult To See That Irregularity Measures S(g) Amentioning
confidence: 99%
“…More about (4) one can refer to [9,16,23,27,36,42]. Based on (4) in [19] a measure called Edwards irregularity measure was defined as…”
Section: It Is Not Difficult To See That Irregularity Measures S(g) Amentioning
confidence: 99%
“…Let b( ) be the number of the boundary H -points of an H -triangle . In this note we prove that any H -triangle with exactly 3 interior H -points can have 3,4,5,6, 7, 8, 9, 10, 11, 12, 13, 14 or 16 H -points on its boundary. …”
mentioning
confidence: 99%
“…On the basis of [1] we show that any H -triangle with exactly 3 interior H -points can have 3,4,5,6,7,8,9,10,11,12,13,14 or 16 H -points on its boundary, and cannot have 15 nor greater than 17 such points. We will use the notion of level of an H -triangle = conv{x, y, z}.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…More on the inequality (5) one can find in [12,20,25,44]. Based on (5), in [21] Edwards' irregularity measure was defined as…”
Section: A Graph G Is Regular If and Only Ifmentioning
confidence: 99%