Results 21 to 30 of about 2,201 (118)
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
Discussiones Mathematicae Graph Theory, 2013 Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj +1 more source
On Computing Centroids According to the p-Norms of Hamming Distance Vectors [PDF]
, 2019 In this paper we consider the p-Norm Hamming Centroid problem which asks to determine whether some given strings have a centroid with a bound on the p-norm of its Hamming distances to the strings.
Chen, Jiehua +2 more
core +2 more sources
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards +4 more
core +3 more sources
ADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE
Taiwanese Journal of Mathematics, 2008 An adjacent vertex distinguishing total coloring of a graph $G$ is a proper total coloring of $G$ such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing total coloring of $G$ is denoted by $\chi''_{a}(G)$.
Wang, Weifan, Wang, Yiqiao
openaire +2 more sources
Finding Cycles and Trees in Sublinear Time [PDF]
, 2011 We present sublinear-time (randomized) algorithms for finding simple cycles of length at least $k\geq 3$ and tree-minors in bounded-degree graphs. The complexity of these algorithms is related to the distance of the graph from being $C_k$-minor-free ...
Alon +20 more
core +4 more sources
Sigma Partitioning: Complexity and Random Graphs
, 2018 A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors in $P_i$. The
Ahadi, Arash +2 more
core +1 more source
Adjacent vertex distinguishing total coloring of corona product of graphs
Ars Mathematica ContemporaneaAn adjacent vertex distinguishing total $k$-coloring $f$ of a graph $G$ is a proper total $k$-coloring of $G$ such that no pair of adjacent vertices has the same color sets, where the color set at a vertex $v$, $C^G_f(v)$, is $\{f(v)\} \cup \{f(vu)|u \in V (G), vu \in E(G)\}$. In 2005 Zhang et al. posted the conjecture (AVDTCC) that every simple graph $
Furmańczyk, Hanna, Zuazua, Rita
openaire +3 more sources
Distant sum distinguishing index of graphs
, 2017 Consider a positive integer $r$ and a graph $G=(V,E)$ with maximum degree $\Delta$ and without isolated edges. The least $k$ so that a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ exists such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$ for every ...
Przybyło, Jakub
core +1 more source
Breaking Instance-Independent Symmetries In Exact Graph Coloring
, 2011 Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is also used to model more traditional CSPs relevant to AI, such as planning,
Aloul, F. A. +3 more
core +1 more source
Distinguishing Chromatic Number of Random Cayley graphs
, 2016 The \textit{Distinguishing Chromatic Number} of a graph $G$, denoted $\chi_D(G)$, was first defined in \cite{collins} as the minimum number of colors needed to properly color $G$ such that no non-trivial automorphism $\phi$ of the graph $G$ fixes each ...
Balachandran, Niranjan +1 more
core +1 more source