Results 11 to 20 of about 745,346 (269)
k-forested choosability of graphs with bounded maximum average degree [PDF]
, 2011 Please cite this paper in press as X. Zhang, G. Liu, J.-L. Wu, k-forested choosability of graphs with bounded maximum average degree, Bulletin of the Iranian Mathematical Society, to ...
Xin Zhang, Guizhen Liu, Jianliang Wu
+7 more sources
Neighbor Sum Distinguishing Index of Graphs with Maximum Average Degree
Journal of Applied Mathematics and Physics, 2021 A proper k-edge coloring of a graph G = (V(G), E(G)) is an assignment c: E(G) → {1, 2, …, k} such that no two adjacent edges receive the same color. A neighbor sum distinguishing k-edge coloring of G is a proper k-edge coloring of G such that for each edge uv ∈ E(G). The neighbor sum distinguishing index of a graph G is the least integer k such that G
Xizhao Sun
openalex +3 more sources
Distributed Mechanism for Detecting Average Consensus with Maximum-Degree Weights in Bipartite Regular Graphs [PDF]
Mathematics, 2021 In recent decades, distributed consensus-based algorithms for data aggregation have been gaining in importance in wireless sensor networks since their implementation as a complementary mechanism can ensure sensor-measured values with high reliability and
Martin Kenyeres, Jozef Kenyeres
doaj +2 more sources
List 3-dynamic coloring of graphs with small maximum average degree [PDF]
Discrete Mathematics, 2016 An $r$-dynamic $k$-coloring of a graph $G$ is a proper $k$-coloring such that for any vertex $v$, there are at least $\min\{r, _G(v) \}$ distinct colors in $N_G(v)$. The $r$-dynamic chromatic number $ _r^d(G)$ of a graph $G$ is the least $k$ such that there exists an $r$-dynamic $k$-coloring of $G$.
Seog‐Jin Kim, Boram Park
openalex +5 more sources
Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph [PDF]
The Electronic Journal of Combinatorics, 2022 The maximum average degree $\mathrm{mad}(G)$ of a graph $G$ is the maximum over all subgraphs of $G$, of the average degree of the subgraph. In this paper, we prove that for every $G$ and positive integer $k$ such that $\mathrm{mad}(G) \ge k$ there exists $S \subseteq V(G)$ such that $\mathrm{mad}(G - S) \le \mathrm{mad}(G) - k$ and $G[S]$ is $(k-1 ...
Wojciech Nadara, Marcin Smulewicz
openalex +4 more sources
Linear List Coloring of Some Sparse Graphs
Discussiones Mathematicae Graph Theory, 2021 A linear k-coloring of a graph is a proper k-coloring of the graph such that any subgraph induced by the vertices of any pair of color classes is a union of vertex-disjoint paths. A graph G is linearly L-colorable if there is a linear coloring c of G for
Chen Ming, Li Yusheng, Zhang Li
doaj +3 more sources
Average eccentricity, minimum degree and maximum degree in graphs [PDF]
Journal of Combinatorial Optimization, 2019 Let $G$ be a connected finite graph with vertex set $V(G)$. The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is defined as $\frac{1}{|V(G)|}\sum_{v \in V(G)}e(v)$. We show that the average eccentricity of a connected graph of order $n$, minimum degree $ $ and maximum degree
Peter Dankelmann, Fadekemi Janet Osaye
openalex +4 more sources
Maximum average degree and relaxed coloring [PDF]
Discrete Mathematics, 2018 4 ...
Michael C. Kopreski, Gexin Yu
openalex +5 more sources
Equitable Coloring and Equitable Choosability of Graphs with Small Maximum Average Degree
Discussiones Mathematicae Graph Theory, 2018 A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k independent subsets V1, V2, . . . , Vk such that ||Vi|−|Vj || ≤ 1 (1 ≤ i, j ≤ k). A graph G is equitably k-choosable if, for any given k-uniform list assignment
Dong Aijun, Zhang Xin
doaj +2 more sources
Reconfiguring colorings of graphs with bounded maximum average degree [PDF]
Journal of Combinatorial Theory, Series B, 2020 7 pages; minor clarifications beyond the published ...
Carl Feghali
openalex +5 more sources