Results 11 to 20 of about 395,936 (323)
Multicluster Interleaving on Paths and Cycles [PDF]
IEEE Transactions on Information Theory, 2005 Interleaving codewords is an important method not only for combatting burst errors, but also for distributed data retrieval. This paper introduces the concept of multicluster interleaving (MCI), a generalization of traditional interleaving problems. MCI problems for paths and cycles are studied.
Jiang, Anxiao (Andrew), Bruck, Jehoshua
openaire +8 more sources
Complexity of Coloring Graphs without Paths and Cycles
, 2013 Let $P_t$ and $C_\ell$ denote a path on $t$ vertices and a cycle on $\ell$ vertices, respectively. In this paper we study the $k$-coloring problem for $(P_t,C_\ell)$-free graphs.
Pavol Hell, Shenwei Huang
openalex +4 more sources
Broadcasting on paths and cycles
Discrete Mathematics, 2022 arXiv admin note: text overlap with arXiv:2003 ...
Reaz Huq, Paweł Prałat
openaire +2 more sources
Counting Arithmetical Structures on Paths and Cycles [PDF]
, 2018 Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vectors d, r such that (diag (d) - A) r=0 , where A is the adjacency matrix of G.
Braun, Benjamin +8 more
core +4 more sources
The Optimal Rubbling Number of Paths, Cycles, and Grids
Complexity, 2021 A pebbling move on a graph G consists of the removal of two pebbles from one vertex and the placement of one pebble on an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed, which is also called the strict rubbling ...
Zheng-Jiang Xia, Zhen-Mu Hong
doaj +1 more source
Characterization of signed paths and cycles admitting minus dominating function [PDF]
Communications in Combinatorics and Optimization, 2020 Let $G=(V,E,\sigma)$ be a finite signed graph. A function $f: V \rightarrow\{-1,0,1\}$ is a minus dominating function (MDF) of $ G $ if $f(u)+\sum_{v \in N(u)} \sigma (uv)f(v)\geq 1 $ for all $ u\in V $. In this paper we characterize signed paths and
S.R. Shreyas, M. Joseph
doaj +1 more source
Criticality indices of 2-rainbow domination of paths and cycles [PDF]
Opuscula Mathematica, 2016 A \(2\)-rainbow dominating function of a graph \(G\left(V(G),E(G)\right)\) is a function \(f\) that assigns to each vertex a set of colors chosen from the set \(\{1,2\}\) so that for each vertex with \(f(v)=\emptyset\) we have \({\textstyle\bigcup_{u\in ...
Ahmed Bouchou, Mostafa Blidia
doaj +1 more source
Broadcasts on paths and cycles
Discrete Applied Mathematics, 2020 A broadcast on a graph $G=(V,E)$ is a function $f: V\longrightarrow \{0,\ldots,\operatorname{diam}(G)\}$ such that $f(v)\leq e\_G(v)$ for every vertex $v\in V$, where$\operatorname{diam}(G)$ denotes the diameter of $G$ and $e\_G(v)$ the eccentricity of $v$ in $G$.
Sabrina Bouchouika +2 more
openaire +4 more sources
Hamiltonian paths and cycles in hypertournaments [PDF]
Journal of Graph Theory, 1997 If \(n\) and \(k\) are integers, \(n \geq k > 1\), a \(k\)-hypertournament \(T\) on \(n\) vertices consists of a set \(V\) of vertices, where \(|V|= n\), and a set \(A\) of \(k\)-tuples (``arcs'') of vertices such that for any \(k\)-subset \(S\) of \(V\), \(A\) contains exactly one of the \(k\)! \(k\)-tuples whose entries belong to \(S\). Note that a 2-
Gutin, Gregory, Yeo, A.
openaire +11 more sources
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Christian Löwenstein +2 more
doaj +1 more source