Results 41 to 50 of about 445,292 (276)
The Maximum Distinguishing Number of a Group [PDF]
The Electronic Journal of Combinatorics, 2006 Let $G$ be a group acting faithfully on a set $X$. The distinguishing number of the action of $G$ on $X$, denoted $D_G(X)$, is the smallest number of colors such that there exists a coloring of $X$ where no nontrivial group element induces a color-preserving permutation of $X$.
openaire +3 more sources
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
Automorphisms and Distinguishing Numbers of Geometric Cliques [PDF]
Discrete & Computational Geometry, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael O. Albertson, Debra L. Boutin
openaire +2 more sources
General neighbour-distinguishing index via chromatic number [PDF]
, 2010 An edge colouring of a graph G without isolated edges is neighbour-distinguishing if any two adjacent vertices have distinct sets consisting of colours of their incident edges. The general neighbour-distinguishing index of G is the minimum number gndi(G)
Soták, Roman, Horňák, Mirko
core +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
Distinguishing Chromatic Numbers of Bipartite Graphs [PDF]
The Electronic Journal of Combinatorics, 2009 Extending the work of K.L. Collins and A.N. Trenk, we characterize connected bipartite graphs with large distinguishing chromatic number. In particular, if $G$ is a connected bipartite graph with maximum degree $\Delta \geq 3$, then $\chi_D(G)\leq 2\Delta -2$ whenever $G\not\cong K_{\Delta-1,\Delta}$, $K_{\Delta,\Delta}$.
Claude Laflamme, Karen Seyffarth
openaire +2 more sources
Graphs with Large Distinguishing Chromatic Number [PDF]
The Electronic Journal of Combinatorics, 2013 The distinguishing chromatic number $\chi_D(G)$ of a graph $G$ is the minimum number of colours required to properly colour the vertices of $G$ so that the only automorphism of $G$ that preserves colours is the identity. For a graph $G$ of order $n$, it is clear that $1\leq\chi_D(G)\leq n$, and it has been shown that $\chi_D(G)=n$ if and only if $G$ is
Michael S. Cavers, Karen Seyffarth
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric radiation therapy presents unique challenges compared to adult treatments, including those of immobilization, potential need for sedation, and the critical importance of accurate, reproducible positioning. Additionally, heightened attention to imaging doses is necessary to minimize long‐term toxicity in survivors.
Parham Alaei +17 more
wiley +1 more source