Results 41 to 50 of about 87,555 (181)
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2016 The girth of a graph, i.e. the length of its shortest cycle, is a fundamental graph parameter. Unfortunately all known algorithms for computing, even approximately, the girth and girth-related structures in directed weighted m-edge and n-node graphs ...
J. Pachocki +4 more
semanticscholar +1 more source
Families of Small Regular Graphs of Girth 5 [PDF]
, 2011 In this paper we obtain $(q+3)$--regular graphs of girth 5 with fewer vertices than previously known ones for $q=13,17,19$ and for any prime $q \ge 23$ performing operations of reductions and amalgams on the Levi graph $B_q$ of an elliptic semiplane of ...
Abreu +34 more
core +4 more sources
Italian National Conference on Sensors, 2016 Girth weld cracking is one of the main failure modes in oil and gas pipelines; girth weld cracking inspection has great economic and social significance for the intrinsic safety of pipelines.
Q. Feng +5 more
semanticscholar +1 more source
Spectra of Orders for k-Regular Graphs of Girth g
Discussiones Mathematicae Graph Theory, 2021 A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs of infinitely many orders are known to exist. Our goal, for given k and g, is the classification of all orders n for which a (k, g)-graph of order n ...
Jajcay Robert, Raiman Tom
doaj +1 more source
The 4-girth-thickness of the complete multipartite graph
, 2019 The $g$-girth-thickness $\theta(g,G)$ of a graph $G$ is the smallest number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we calculate the $4$-girth-thickness $\theta(4,G)$ of the complete $m$-partite graph $G$ when each ...
Rubio-Montiel, Christian
core +1 more source
On Unicyclic Graphs with Minimum Graovac–Ghorbani Index
MathematicsIn discrete mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
Snježana Majstorović Ergotić
doaj +1 more source
Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution
IEEE AccessThis paper studies a class of quasi-cyclic LDPC (QC-LDPC) codes, i.e., Tanner (3, 23)-regular QC-LDPC codes of code length $23p$ with $p$ being a prime and $p \equiv 1 (\mathrm {mod} 69)$ .
Qi Wang +5 more
doaj +1 more source
Acyclic edge coloring of planar graphs
AIMS Mathematics, 2022 An acyclic edge coloring of a graph $ G $ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of $ G $, denoted by $ \chi^{'}_{a}(G) $, is the smallest integer $ k $ such that $ G $ is acyclically edge $ k $
Yuehua Bu +3 more
doaj +1 more source
The forcing number of graphs with given girth [PDF]
, 2016 In this paper, we study a dynamic coloring of the vertices of a graph G that starts with an initial subset S of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored
Randy Davila, Michael A. Henning
semanticscholar +1 more source
Extremal Khovanov homology and the girth of a knot [PDF]
arXiv, 2020 We utilize relations between Khovanov and chromatic graph homology to determine extreme Khovanov groups and corresponding coefficients of the Jones polynomial. The extent to which chromatic homology and chromatic polynomial can be used to compute integral Khovanov homology of a link depends on the maximal girth of its all-positive graphs. In this paper
arxiv