On a classical theorem on the diameter and minimum degree of a graph
Sign Up to like & getrecommendations! Published in 2017 at "Acta Mathematica Sinica, English Series"
DOI: 10.1007/s10114-017-6324-y
Abstract: In this work, we obtain good upper bounds for the diameter of any graph in terms of its minimum degree and its order, improving a classical theorem due to Erdös, Pach, Pollack and Tuza. We… read more here.
Keywords: diameter minimum; classical theorem; graph; theorem diameter ... See more keywords
Hamiltonicity, minimum degree and leaf number
Sign Up to like & getrecommendations! Published in 2017 at "Acta Mathematica Hungarica"
DOI: 10.1007/s10474-017-0716-4
Abstract: We prove a new sufficient condition for a connected graph to be Hamiltonian in terms of the leaf number and the minimum degree. Our results give solutions to conjectures on the Hamiltonicity and traceability of… read more here.
Keywords: hamiltonicity minimum; minimum degree; leaf number; degree leaf ... See more keywords
The minimum value of geometric-arithmetic index of graphs with minimum degree 2
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0062-4
Abstract: The geometric-arithmetic index was introduced in the chemical graph theory and it has shown to be applicable. The aim of this paper is to obtain the extremal graphs with respect to the geometric-arithmetic index among… read more here.
Keywords: index; graphs minimum; minimum value; arithmetic index ... See more keywords
A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Sciences"
DOI: 10.1007/s10958-018-4132-2
Abstract: We prove that a connected graph of minimum degree 6 has a spanning tree such that at least 1121$$ \frac{11\ }{21} $$ of its vertices are leaves. read more here.
Keywords: bound number; graph minimum; connected graph; minimum degree ... See more keywords
Minimum Degree-Weighted Distance Decoding for Polynomial Residue Codes With Non-Coprime Moduli
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Wireless Communications Letters"
DOI: 10.1109/lwc.2017.2716371
Abstract: This letter presents a new decoding algorithm called the minimum degree-weighted distance decoding for polynomial residue codes with non-coprime moduli. The newly proposed decoding is based on the degree-weighted distance and is different from the… read more here.
Keywords: distance; weighted distance; decoding polynomial; degree weighted ... See more keywords
Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices
Sign Up to like & getrecommendations! Published in 2017 at "Siberian Mathematical Journal"
DOI: 10.1134/s003744661704005x
Abstract: In 1940, in attempts to solve the Four Color Problem, Henry Lebesgue gave an approximate description of the neighborhoods of 5-vertices in the class P5 of 3-polytopes with minimum degree 5. This description depends on… read more here.
Keywords: minor stars; low light; polytopes minimum; stars polytopes ... See more keywords
Light Minor 5-Stars in 3-Polytopes with Minimum Degree 5
Sign Up to like & getrecommendations! Published in 2019 at "Siberian Mathematical Journal"
DOI: 10.1134/s0037446619020071
Abstract: Attempting to solve the Four Color Problem in 1940, Henry Lebesgue gave an approximate description of the neighborhoods of 5-vertices in the class P5 of 3-polytopes with minimum degree 5. This description depends on 32… read more here.
Keywords: light minor; polytopes minimum; minimum degree; minor stars ... See more keywords
Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree
Sign Up to like & getrecommendations! Published in 2022 at "Axioms"
DOI: 10.3390/axioms11050219
Abstract: Let H be a class of given graphs. A graph G is said to be H-free if G contains no induced copies of H for any H∈H. In this article, we characterize all connected subgraph… read more here.
Keywords: minimum degree; connectivity connected; edge connectivity; characterizing forbidden ... See more keywords