Results 41 to 50 of about 76,042 (299)

Diameter and girth of Torsion Graph

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014
Let R be a commutative ring with identity. Let M be an R-module and T (M)* be the set of nonzero torsion elements. The set T(M)* makes up the vertices of the corresponding torsion graph, ΓR(M), with two distinct vertices x, y ∈ T(M)* forming an edge if ...
Rad P. Malakooti   +3 more
doaj   +1 more source

Exploring the Volume Paradox: Comparing Different Formulas for Estimating the Wood Volume of Trees and Logs in Nepal. [PDF]

open access: yesScientifica (Cairo)
Accurate estimation of tree and log volume plays a pivotal role in a wide range of applications within the field of forestry, especially in biomass assessment and forest management. The effectiveness and applicability of formulas for volume estimation have recently become a topic of extensive deliberation among forestry officials and a diverse array of
Karki P, Dangal S, Cedamon E.
europepmc   +2 more sources

Simple-intersection graphs of rings

open access: yesAIMS Mathematics, 2023
Let R be a ring with unity. In this paper, we introduce a new graph associated with R called the simple-intersection graph of R, denoted by GS(R). The vertices of GS(R) are the nonzero ideals of R, and two vertices are adjacent if and only if their ...
Fida Moh'd, Mamoon Ahmed
doaj   +1 more source

Girth in digraphs [PDF]

open access: yesJournal 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.
Bermond, J. C.   +3 more
openaire   +2 more sources

Of Girths and Brains [PDF]

open access: yesAmerican Journal of Neuroradiology, 2014
It is now official: We Americans are no longer the heaviest in the Western World. This ignominious claim belongs south of the border, to Mexico. The obesity rate of Mexicans (32.8%) has now surpassed that of Americans (31.8%).
openaire   +2 more sources

Extremal Edge-Girth-Regular Graphs

open access: yesGraphs and Combinatorics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ajda Zavrtanik Drglin   +3 more
openaire   +3 more sources

A contribution to the anatomy of two rare cetacean species: The hourglass dolphin (Cephalorhynchus cruciger) and the spectacled porpoise (Phocoena dioptrica)

open access: yesThe Anatomical Record, EarlyView.
Abstract The anatomical description of the hourglass dolphin (Cephalorhynchus cruciger) and the spectacled porpoise (Phocoena dioptrica) remains largely unexplored, due to limited specimen availability and preservation challenges. This study employed digital imaging techniques, conventional histology, and computed tomography to provide visualization of
Jean‐Marie Graïc   +26 more
wiley   +1 more source

On Unicyclic Graphs with Minimum Graovac–Ghorbani Index

open access: yesMathematics
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

Early evolutionary history of the seed

open access: yesBiological Reviews, EarlyView.
ABSTRACT The seed is an essential stage in the life history of gymnospermous and angiospermous plants, facilitating both their survival and dispersal. We reappraise knowledge of the evolutionary history of the gymnospermous seed, from its origin in the late Devonian through to the well‐known end‐Permian extinctions – an interval encompassing the ...
Richard M. Bateman   +2 more
wiley   +1 more source

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

open access: yesIEEE 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   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy