RO EN
New Bounds For Degree Sequence Of Graphs
Authors: Akbar Jahanbani
Keywords: Degree sequence of graph, Maximum degree, Minimum degree.
– 0.12 Mb
Keywords: Degree sequence of graph, Maximum degree, Minimum degree.
Abstract
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}).Shahrood University of Technology
Department of Mathematics, Shahrood University of Technology,
Shahrood, Iran
E-mail:
Department of Mathematics, Shahrood University of Technology,
Shahrood, Iran
E-mail:
Fulltext
– 0.12 Mb
Contents
- Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers
- Completeness of the First-Order Logic of Partial Quasiary Predicates with the Complement Composition
- New Bounds For Degree Sequence Of Graphs
- On the signed Italian domination of graphs
- A Novel Hybrid Algorithm for Minimizing Total Weighted Tardiness Cost
- Mixed Algorithm for Combinations Generation
- In memoriam of Yurii Rogozhin
