Results 241 to 250 of about 745,346 (269)

Neighbor Sum Distinguishing Total Colorings of Graphs with Bounded Maximum Average Degree

Acta Mathematica Sinica, English Series, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun, Dong, Guang, Hui Hui, Wang
openalex   +3 more sources

The Spectral Radius, Maximum Average Degree and Cycles of Consecutive Lengths of Graphs

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wenqian Zhang
openalex   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Total list weighting of graphs with bounded maximum average degree

Discrete Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu-Chang Liang, Yunfang Tang, Tsai-Lien Wong, Xuding Zhu   +3 more
openaire   +1 more source

Neighbor Sum Distinguishing Edge Colorings of Graphs with Small Maximum Average Degree

Bulletin of the Malaysian Mathematical Sciences Society, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gao, Yuping, Wang, Guanghui, Wu, Jianliang   +2 more
openaire   +2 more sources

Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable

2014
For graphs of bounded maximum average degree, we consider the problem of 2-distance coloring. This is the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbor receive different colors. It is already known that planar graphs of girth at least 6 and of maximum degree Δ are list 2-distance (Δ+2 ...
Bonamy, Marthe, Lévêque, Benjamin, Pinlou, Alexandre   +2 more
openaire   +1 more source

On \(r\)-hued coloring of graphs with maximum average degree less than 3.

2019
Summary: For an integer \(r>0\), an \(r\)-hued coloring of a graph \(G\) is a proper coloring \(c\) such that for any vertex \(v\) of degree \(d(v)\), there are at least \(\min\{d(v),r\}\) kinds of colors present at its neighborhood. The \(r\)-\textit{hued chromatic number} of \(G\), \(\chi_r(G)\), is the least number of colors used to \(r\)-hued color
Song, Huimin, Lai, Hong-Jian, Wu, Jianliang   +2 more
openaire   +2 more sources

A maximum self-esteem degree based feedback mechanism for group consensus reaching with the distributed linguistic trust propagation in social network

Information Fusion, 2021
Jian Wu, Hamido Fujita
exaly  

Maximum Likelihood Degree, Complete Quadrics, and $\mathbb{C}^*$-Action

SIAM Journal on Applied Algebra and Geometry, 2021
Mateusz Michałek, Leonid Monin, Jarosław A Wiśniewski   +2 more
exaly  

Reliability computation via a transformed mixed-degree cubature rule and maximum entropy

Applied Mathematical Modelling, 2022
Jun Xu
exaly  

Enumeration of subtrees and BC-subtrees with maximum degree no more than k in trees

Theoretical Computer Science, 2021
Hua Wang, Xiao-dong Zhang
exaly