Results 11 to 20 of about 59,293 (196)
A stability result for girth‐regular graphs with even girth [PDF]
Journal of Graph Theory, 2021 AbstractLet denote a finite, connected, simple graph. For an edge of let denote the number of girth cycles containing . For a vertex of let be the set of edges incident to ordered such that . Then is called the signature of . The graph is said to be girth‐regular if all of its vertices have the same signature.
György Kiss +2 more
openaire +1 more source
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011 This article considers the problem of computing a minimum weight cycle in weighted undirected graphs. Given a weighted undirected graph G = ( V , E , w ), let C be a minimum weight cycle of G , let
Liam Roditty, Roei Tov
openaire +1 more source
Journal of Graph Theory, 1980 AbstractFor an integer k > 2, the best function m(n, k) is determined such that every strong digraph of order n with at least m(n, k) arcs contains a circuit of length k or less.
Jean-Claude Bermond +3 more
openaire +2 more sources
Coloring Powers and Girth [PDF]
SIAM Journal on Discrete Mathematics, 2016 15 pages, 2 figures, 2 tables; from v1 to v2, one section removed, one theorem ...
Kang, J.R., Kang, J.R., Pirot, F.F.
openaire +4 more sources
On Hypergraphs of Girth Five [PDF]
The Electronic Journal of Combinatorics, 2003 In this paper, we study $r$-uniform hypergraphs ${\cal H}$ without cycles of length less than five, employing the definition of a hypergraph cycle due to Berge. In particular, for $r = 3$, we show that if ${\cal H}$ has $n$ vertices and a maximum number of edges, then $$|{\cal H}|={\textstyle 1\over6}n^{3/2} + o(n^{3/2}).$$ This also asymptotically ...
Felix Lazebnik, Jacques Verstraëte
openaire +2 more sources
Radius, girth and minimum degree [PDF]
Journal of Graph Theory, 2022 AbstractThe objective of the present paper is to study the maximum radius of a connected graph of order , minimum degree and girth at least . Erdős, Pach, Pollack and Tuza proved that if , that is, the graph is triangle‐free, then , and noted that up to the value of the additive constant, this upper bound is tight.
Vojtech Dvorák +3 more
openaire +4 more sources
Computing Graph Roots Without Short Cycles [PDF]
, 2009 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 H2, however Motwani and Sudan proved that it is NP-complete to determine if a given ...
Farzad, Babak +3 more
core +3 more sources
A Note on the Girth of (3, 19)-Regular Tanner’s Quasi-Cyclic LDPC Codes
IEEE Access, 2021 In this article, we study the cycle structure of (3, 19)-regular Tanner’s quasi-cyclic (QC) LDPC codes with code length $19p$ , where $p$ is a prime and $p\equiv 1~(\bmod ~57)$ , and transform the conditions for the existence of cycles of ...
Manjie Zhou +4 more
doaj +1 more source
Governance rules for managing smart city information
Urban Governance, 2022 Collecting, processing, and distributing information has always been a core function of government. This core function has evolved from the earliest ancient governments using clay tablets to today's smart cities relying on integrated data exchanges (IDE).
David Landsbergen +2 more
doaj +1 more source
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices
IEEE Access, 2018 In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with
Farzane Amirzade, Mohammad-Reza Sadeghi
doaj +1 more source