Results 111 to 120 of about 92,304 (328)
Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem [PDF]
Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H^2.
Farzad, Babak, Karimi, Majid
core
Exponents of the primitive Boolean matrices with fixed girth [PDF]
The $girth$ of a primitive Boolean matrix is defined to be the $girth$ of its associated digraph. In this paper, among all primitive Boolean matrices of order $n$, the primitive exponents of those of girth $g$ are considered. For the primitive matrices of both order $n\geq 10$ and girth $g>\frac{n^{2}-4n}{4(n-3)}$, the matrices with primitive exponents
arxiv
AbstractWe consider four families of pancake graphs, which are Cayley graphs, whose vertex sets are either the symmetric group on n objects or the hyperoctahedral group on n objects and whose generating sets are either all reversals or all reversals inverting the first k elements (called prefix reversals).
openaire +2 more sources
Size of Graphs with High Girth
Let n≥4 be a positive integer and let ex (ν;{C3, . . . , Cn}) denote the maximum number of edges in a {C3, . . . , Cn}-free simple graph of order ν. This paper givesthe exact value of this function for all νup to ⌊(16n−15)/5⌋. This result allows usto deduce all the different values of the girths that such extremal graphs can have. Let k≥0 be an integer.
Abajo Casado, María Encarnación+1 more
openaire +3 more sources
ABSTRACT Background Metformin shows potential in combating clozapine‐induced weight gain (CIWG). However, current evidence for its use remains limited. Through an audit we determined the prevalence of metformin use among clozapine‐treated patients and its impact on weight and waist circumference (WC).
Bee Leng Per+5 more
wiley +1 more source
Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation
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
Convolutional cylinder-type block-circulant cycle codes [PDF]
In this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. Then we devote a convolutional form to these codes, such that their generator matrix
Mohammad Gholami, Mehdi Samadieh
doaj
Induced Pseudomembrane Enrichment in Long Nerve Allograft Reconstruction. [PDF]
ABSTRACT Introduction/Aims Long nerve defects are typically reconstructed with autograft or processed acellular nerve allograft (PNA). PNA is convenient and avoids donor morbidity but lacks the neurotrophic environment of autograft. Increased levels of neurotrophic factors have been identified in pseudomembranes induced around silicone implanted ...
Protzuk OA+5 more
europepmc +2 more sources
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth [PDF]
The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and recent literature. In this paper, we consider the problem of listing connected subgraphs with bounded girth. As a large
arxiv +1 more source
Reflexivity and the girth of spheres
James [4] introduced the concept of a uniformly non-square unit ball and certain other geometric properties of Banach spaces, all related to reflexivity. The purpose of this paper is to focus attention on a similar property, a generalized (negation ot) uniform non-squareness, and show that it can be expressed in terms of the "girth" of the unit ball ...
Schäffer, J.J., SUNDARESAN, K.
openaire +2 more sources