Results 31 to 40 of about 16,859 (164)
THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n
BarekengLet be a commutative ring, and denote the set of all idempotent elements of . The triple idempotent graph of , denoted by , is defined as an undirected simple graph whose vertex set .
Vika Yugi Kurniawan +2 more
doaj +1 more source
On Sparsity Conditions Guaranteeing a Fractional Coloring
Journal of Graph Theory, EarlyView.ABSTRACT A graph has an ( a : b ) $(a:b)$ ‐coloring if there exists an assignment from the vertices to subsets of { 1 , … , a } $\{1,\ldots ,a\}$ with size b $b$ such that adjacent vertices are assigned disjoint subsets. Odd girth at least 2 k + 1 $2k+1$ is a necessary condition for a graph to have a ( 2 k + 1 : k ) $(2k+1:k)$‐coloring.
Ilkyoo Choi
wiley +1 more source
THE TRIPLE IDENTITY GRAPH OF THE RING Z_n
BarekengLet be a commutative ring with identity and is an identity element of . The triple identity graph of the ring , represented by ), is an undirected simple graph with the vertex set .
Vika Yugi Kurniawan +2 more
doaj +1 more source
A graph and its complement with specified properties III: girth and circumference
International Journal of Mathematics and Mathematical Sciences, 1979 In this series, we investigate the conditions under which both a graph G and its complement G¯ possess certain specified properties. We now characterize all the graphs G such that both G and G¯ have the same girth.
Jin Akiyama, Frank Harary
doaj +1 more source
Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs
Journal of Graph Theory, EarlyView.ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho +3 more
wiley +1 more source
The 1 3 $\frac{1}{3}$‐Conjectures for Domination in Cubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A set S $S$ of vertices in a graph G $G$ is a dominating set of G $G$ if every vertex not in S $S$ is adjacent to a vertex in S $S$. The domination number of G $G$, denoted by γ ( G ) $\gamma (G)$, is the minimum cardinality among all dominating sets in G $G$. In a breakthrough paper in 2008, Löwenstein and Rautenbach proved that if G $G$ is a
Paul Dorbec, Michael A. Henning
wiley +1 more source
Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation
Tongxin xuebao, 2017 Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 ...
Qing ZHU +4 more
doaj
Environment Conservation Journal, 2014 Trees act as a sink for CO2 by fixing carbon during photosynthesis and storing surplus carbon as biomass which alter through time as trees grow, die and decay. There is uncertainty about the extent of carbon stored in forests by trees.
P.K. Pilania +2 more
doaj +1 more source
JPGN Reports, EarlyView.Abstract The rising incidence of pediatric Clostridioides difficile infection (CDI), particularly in medically complex patients, calls for novel, individualized treatments. While fecal microbiota transplantation (FMT) is well‐described for recurrent CDI, this report describes the first pediatric case of fulminant CDI with toxic megacolon successfully ...
Dana McCarney +3 more
wiley +1 more source
A New Method for Building Low-Density-Parity-Check Codes
International Journal of Technology, 2019 This paper proposes a new method for building low-density-parity-check codes, exempt of cycle of length 4, based on a circulant permutation matrix, which needs very little memory for storage it in the encoder and a dual diagonal structure is applied ...
Tehami Mohammed Amine, Djebbari Ali
doaj +1 more source