Results 1 to 10 of about 65,527 (109)
A Characterization for the Neighbor-Distinguishing Index of Planar Graphs
Symmetry, 2022 Symmetry, such as structural symmetry, color symmetry and so on, plays an important role in graph coloring. In this paper, we use structural symmetry and color symmetry to study the characterization for the neighbor-distinguishing index of planar graphs. Let G be a simple graph with no isolated edges. The neighbor-distinguishing edge coloring of G is a
Jingjing Huo, Huo Jingjing
exaly +6 more sources
On the Total-Neighbor-Distinguishing Index by Sums [PDF]
Graphs and Combinatorics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monika Pilśniak +2 more
exaly +3 more sources
Some bounds on the neighbor-distinguishing index of graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weifan Wang +2 more
exaly +3 more sources
Edge-partitions of graphs and their neighbor-distinguishing index
Discrete Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bojan Vučković
exaly +4 more sources
An Improved Upper Bound on Neighbor Expanded Sum Distinguishing Index
Discussiones Mathematicae Graph Theory, 2020 A total k-weighting f of a graph G is an assignment of integers from the set {1, . . . , k} to the vertices and edges of G. We say that f is neighbor expanded sum distinguishing, or NESD for short, if Σw∈N(v) (f(vw) + f(w)) differs from Σw∈N(u)(f(uw) + f(
Vučković Bojan
doaj +2 more sources
A Note on Neighbor Expanded Sum Distinguishing Index
Discussiones Mathematicae Graph Theory, 2017 A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = {1, . . . , k}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction.
Flandrin Evelyne +4 more
doaj +2 more sources
On the Total Neighbor Sum Distinguishing Index of IC-Planar Graphs
Symmetry, 2021 A proper total k-coloring ϕ of G with ∑z∈EG(u)∪{u}ϕ(z)≠∑z∈EG(v)∪{v}ϕ(z) for each uv∈E(G) is called a total neighbor sum distinguishing k-coloring, where EG(u)={uv|uv∈E(G)}.
Donghan Zhang, Chao Li, Fugang Chao
exaly +2 more sources
The strict neighbor-distinguishing index of simple graphs with maximum degree five
Ars Combinatoria<p> Suppose that \(\phi\) is a proper edge-\(k\)-coloring of the graph \(G\). For a vertex \(v \in V(G)\), let \(C_\phi(v)\) denote the set of colors assigned to the edges incident with \(v\). The proper edge-\(k\)-coloring \(\phi\) of \(G\) is strict neighbor-distinguishing if for any adjacent vertices \(u\) and \(v\), \(C_\phi(u ...
Danjun Huang +3 more
openaire +3 more sources
Exploring the recurrence and metastasis of breast invasive ductal carcinoma based on machine learning and survival analysis [PDF]
Frontiers in OncologyObjectiveInvasive ductal carcinoma (IDC), the predominant histopathological subtype comprising about 80% of breast malignancies, continues to pose a significant clinical challenge due to frequent recurrence.
Aqiao Xu +8 more
doaj +2 more sources
Automatic Earthquake Declustering Using the Nearest‐Neighbor Distance
Earth and Space ScienceIn the widely adopted description of seismic occurrence, earthquakes are categorized as either background or triggered events. In this work, we present a fully automated, non‐parametric algorithm for distinguishing between these two categories, a process
P. Bountzis +3 more
doaj +2 more sources