Results 41 to 50 of about 2,700 (119)

On Unicyclic Graphs with Minimum Graovac–Ghorbani Index

Mathematics
In 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 Access
This 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, Jingping Che, Huaan Li, Zhen Luo, Bo Zhang, Hui Liu   +5 more
doaj   +1 more source

Biometric relations of freshwater fishes of the Suaza River (Huila Department, Colombia) [PDF]

Acta Ichthyologica et Piscatoria, 2016
The knowledge of freshwater fishes in remote Andean mountains is scarce and restricted to changes of occurrence distribution along a specific gradient.
I. Tobes, R. Miranda, S. Gaspar, M. Peláez-Rodríguez   +3 more
doaj   +3 more sources

Large-Girth Roots of Graphs [PDF]

SIAM Journal on Discrete Mathematics, 2010
14 pages, 4 ...
Anna Adamaszek, Michal Adamaszek
openaire   +4 more sources

Tanner $(J,L)$ Quasi-Cyclic LDPC Codes: Girth Analysis and Derived Codes

IEEE Access, 2019
Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper ...
Hengzhou Xu, Huaan Li, Baoming Bai, Min Zhu, Bo Zhang   +4 more
doaj   +1 more source

Live Weight and Bone Growth from Birth to 23 Months of Age in Holstein–Friesian, Jersey and Crossbred Heifers

Dairy, 2022
Selection pressure for greater milk solid production, calving ease and early puberty attainment has resulted in the alteration of the growth trajectory of New Zealand dairy heifers.
Michaela J. Gibson, Brooke R. Adams, Penny J. Back, Rebecca E. Hickson, Keren E. Dittmer, Chris W. Rogers   +5 more
doaj   +1 more source

High girth and extendability

Discrete Mathematics, 1996
A graph \(G\) is said to be \(k\)-extendable if \(G\) contains a perfect matching, has more than \(2k\) vertices, and every matching of size \(k\) can be extended to a perfect matching. This concept was introduced by \textit{M. D. Plummer} [Discrete Math. 31, 201-210 (1980; Zbl 0442.05060)]. The main result is that for positive integers \(n\) and \(k\)
Pavol Gvozdjak, Jaroslav Nesetril
openaire   +1 more source

THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n

Barekeng
Let  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, Bayu Purboutomo, Nughthoh Arfawi Kurdhi   +2 more
doaj   +1 more source

THE TRIPLE IDENTITY GRAPH OF THE RING Z_n

Barekeng
Let  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, Chessa Fanny Ekasiwi, Santoso Budi Wiyono   +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