Results 61 to 70 of about 76,042 (299)
The Balancing Act: Ergonomic Challenges for Pregnant Microvascular Surgeons in the Operating Room
This study evaluates the intraoperative ergonomic challenges faced by pregnant microvascular surgeons by comparing detailed motion‐analysis data collected at 36–37 weeks' gestation with postpartum assessments. Findings show that pregnancy significantly increases time spent in unsafe postures (particularly involving the neck, elbows, and knees), while ...
Nina Patel +3 more
wiley +1 more source
THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n
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 +2 more
doaj +1 more source
Number of cycles of small length in a graph
Let G be a simple undirected graph. In this article, we obtain an explicit formula for the number of 8-cycles in G in terms of the entries of its adjacency matrix. We provide new formulae to find the number of cycles of length 4, 5 and 6 in G.
Sasmita Barik, Sane Umesh Reddy
doaj +1 more source
An entropy based proof of the Moore bound for irregular graphs [PDF]
We provide proofs of the following theorems by considering the entropy of random walks: Theorem 1.(Alon, Hoory and Linial) Let G be an undirected simple graph with n vertices, girth g, minimum degree at least 2 and average degree d: Odd girth: If g=2r+1 ...
Babu, S. Ajesh, Radhakrishnan, Jaikumar
core +1 more source
Canopy laser scanning (CLS) enhances 3D measurements of large trees by lifting laser scanners into the canopy. Combining CLS with terrestrial laser scanning improves point cloud precision, reduces occlusion and enables detailed assessments of tree architecture and canopy biodiversity, opening new opportunities for forest ecology.
Barbara D'hont +12 more
wiley +1 more source
Independent sets and cuts in large-girth regular graphs [PDF]
We present a local algorithm producing an independent set of expected size $0.44533n$ on large-girth 3-regular graphs and $0.40407n$ on large-girth 4-regular graphs.
Csóka, Endre
core +1 more source
A lower bound on the order of the largest induced forest in planar graphs with high girth
We give here new upper bounds on the size of a smallest feedback vertex set in planar graphs with high girth. In particular, we prove that a planar graph with girth $g$ and size $m$ has a feedback vertex set of size at most $\frac{4m}{3g}$, improving the
Dross, François +2 more
core +2 more sources
On Hypergraphs of Girth Five [PDF]
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 ...
Lazebnik, Felix, Verstraëte, Jacques
openaire +2 more sources
Supersonic transporter (SST) deformity of penile prosthesis: Current management strategies
Abstract Supersonic transporter (SST) deformity, also known as floppy glans syndrome, represents a persistent source of post‐operative dissatisfaction among patients undergoing inflatable penile prosthesis (IPP) implantation. Although infection and mechanical failure rates have declined with advances in device design and surgical technique, SST ...
Mohammed Mahdi +2 more
wiley +1 more source

