Results 1 to 10 of about 402,994 (257)
On multiset colorings of generalized corona graphs [PDF]
Mathematica Bohemica, 2016 A vertex $k$-coloring of a graph $G$ is a \emph{multiset $k$-coloring} if $M(u)\neq M(v)$ for every edge $uv\in E(G)$, where $M(u)$ and $M(v)$ denote the multisets of colors of the neighbors of $u$ and $v$, respectively. The minimum $k$ for which $G$ has
Yun Feng, Wensong Lin
doaj +1 more source
Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree
Axioms, 2023 Neighbor distinguishing colorings of graphs represent powerful tools for solving the channel assignment problem in wireless communication networks. They consist of two forms of coloring: neighbor distinguishing edge coloring, and neighbor distinguishing ...
Jingjing Huo +3 more
doaj +1 more source
Focused verbal inflections in Spanish
Isogloss, 2021 Spanish allows to focus the Number and Person features of the verbal inflection to produce an interpretation similar to that of a contrastively focused pronoun. This squib discusses two properties distinguishing both phenomena.
Carlos Muñoz Pérez, Matías Verdecchia
doaj +3 more sources
Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs
Mathematics, 2023 In this paper, we consider the adjacent vertex distinguishing proper edge coloring (for short, AVDPEC) and the adjacent vertex distinguishing total coloring (for short, AVDTC) of a fuzzy graph.
Zengtai Gong, Chen Zhang
doaj +1 more source
The distinguishing number and the distinguishing index of co-normal product of two graphs
Ratio Mathematica, 2019 The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism.
Saeid Alikhani, Samaneh Soltani
doaj +1 more source
Characterization of graphs with distinguishing number equal list distinguishing number
, 2017 The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling with $d$ labels that is preserved only by a trivial automorphism. A list assignment to $G$ is an assignment $L = \{L(v)\}_{v\in V (G)}$ of lists of labels to the vertices of $G$. A distinguishing $L$-labeling of $G$ is a distinguishing labeling
Alikhani, Saeid, Soltani, Samaneh
openaire +2 more sources
Distinguishing Numbers for Graphs and Groups [PDF]
The Electronic Journal of Combinatorics, 2004 A graph $G$ is distinguished if its vertices are labelled by a map $\phi: V(G) \longrightarrow \{1,2,\ldots, k\}$ so that no non-trivial graph automorphism preserves $\phi$. The distinguishing number of $G$ is the minimum number $k$ necessary for $\phi$ to distinguish the graph. It measures the symmetry of the graph.
openaire +4 more sources
Distinguishing number and adjacency properties [PDF]
Journal of Combinatorics, 2010 One of the most widely studied infinite graphs is the Rado or infinite random graph, written R. A graph satisfies the existentially closed or e.c. adjacency property if for all finite disjoint sets of vertices A and B (one of which may be empty), there is a vertex z / ∈ A ∪ B joined to all of A and to no vertex of B.
Anthony Bonato, Dejan Delic
openaire +1 more source
A Tight Bound on the Set Chromatic Number
Discussiones Mathematicae Graph Theory, 2013 We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > ⌈log2 χ(G)⌉ + 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G ...
Sereni Jean-Sébastien +1 more
doaj +1 more source
Neighbor Sum Distinguishing Total Chromatic Number of Planar Graphs without 5-Cycles
Discussiones Mathematicae Graph Theory, 2020 For a given graph G = (V (G), E(G)), a proper total coloring ϕ: V (G) ∪ E(G) → {1, 2, . . . , k} is neighbor sum distinguishing if f(u) ≠ f(v) for each edge uv ∈ E(G), where f(v) = Σuv∈E(G) ϕ(uv)+ϕ(v), v ∈ V (G). The smallest integer k in such a coloring
Zhao Xue, Xu Chang-Qing
doaj +1 more source