New Bounds For Degree Sequence Of Graphs

Let $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ and $\sum_{i=1}^{n}d_i^{3}$ and relations betwee...

Full description

Bibliographic Details
Main Author: Akbar Jahanbani
Format: Article
Language:English
Published: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2019-09-01
Series:Computer Science Journal of Moldova
Subjects:
Online Access:http://www.math.md/files/csjm/v27-n2/v27-n2-(pp188-203).pdf
id doaj-ea0ee8efd371470cb136fba306730d57
record_format Article
spelling doaj-ea0ee8efd371470cb136fba306730d572020-11-25T02:11:05ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40422019-09-01272(80)188203New Bounds For Degree Sequence Of GraphsAkbar Jahanbani0Department of Mathematics, Shahrood University of TechnologyLet $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ and $\sum_{i=1}^{n}d_i^{3}$ and relations between them. Also, we improve the bounds given in (\ref{sor1}) and (\ref{sor2}).http://www.math.md/files/csjm/v27-n2/v27-n2-(pp188-203).pdfDegree sequence of graphMaximum degreeMinimum degree
collection DOAJ
language English
format Article
sources DOAJ
author Akbar Jahanbani
spellingShingle Akbar Jahanbani
New Bounds For Degree Sequence Of Graphs
Computer Science Journal of Moldova
Degree sequence of graph
Maximum degree
Minimum degree
author_facet Akbar Jahanbani
author_sort Akbar Jahanbani
title New Bounds For Degree Sequence Of Graphs
title_short New Bounds For Degree Sequence Of Graphs
title_full New Bounds For Degree Sequence Of Graphs
title_fullStr New Bounds For Degree Sequence Of Graphs
title_full_unstemmed New Bounds For Degree Sequence Of Graphs
title_sort new bounds for degree sequence of graphs
publisher Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
series Computer Science Journal of Moldova
issn 1561-4042
publishDate 2019-09-01
description Let $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ and $\sum_{i=1}^{n}d_i^{3}$ and relations between them. Also, we improve the bounds given in (\ref{sor1}) and (\ref{sor2}).
topic Degree sequence of graph
Maximum degree
Minimum degree
url http://www.math.md/files/csjm/v27-n2/v27-n2-(pp188-203).pdf
work_keys_str_mv AT akbarjahanbani newboundsfordegreesequenceofgraphs
_version_ 1724916451357229056