Results 41 to 50 of about 154 (132)
On the Intersection Graphs Associeted to Posets
Let (P, ≤) be a poset with the least element 0. The intersection graph of ideals of P, denoted by G(P), is a graph whose vertices are all nontrivial ideals of P and two distinct vertices I and J are adjacent if and only if I ∩ J ≠ {0}.
Afkhami M. +2 more
doaj +1 more source
Abstract Background Diff‐Quik (DQ) staining is widely used in clinical practice for its ease of use and rapid results. However, its potential contamination remains a concern. Hypothesis/Objectives This study aimed to investigate DQ solution contamination in veterinary hospitals and identify factors affecting it through a questionnaire on stain usage ...
Minji Cho, Seulgi Bae
wiley +1 more source
Combinatorics of rectangulations: old and new bijections [PDF]
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs, polytopes ...
Felsner, Stefan +3 more
core +1 more source
Rotor-Routing Induces the Only Consistent Sandpile Torsor Structure on Plane Graphs
We make precise and prove a conjecture of Klivans about actions of the sandpile group on spanning trees. More specifically, the conjecture states that there exists a unique ‘suitably nice’ sandpile torsor structure on plane graphs which is induced by ...
Ankan Ganguly, Alex McDonough
doaj +1 more source
Background – Canine atopic dermatitis (cAD) is a chronic, inflammatory, multifactorial and pruritic disease. The presence of skin barrier impairment (e.g. filaggrin alterations), along with abnormal immune responses, can negatively impact cutaneous barrier function.
Wendie Roldan Villalobos +5 more
wiley +1 more source
This article explores numerous significant additive topological indices based on degrees for linear functional graphs over finite‐dimensional vector spaces. Specifically, we derive some unique topological indices, such as the eccentricity‐based indices and the Wiener index.
Vinnarasi L. +4 more
wiley +1 more source
Sharp Upper Bounds on the Clar Number of Fullerene Graphs
The Clar number of a fullerene graph with n vertices is bounded above by ⌊n/6⌋ − 2 and this bound has been improved to ⌊n/6⌋ − 3 when n is congruent to 2 modulo 6.
Gao Yang, Zhang Heping
doaj +1 more source
In its crystalline state, the α‐icosahedral nanosheet of boron demonstrates superconductivity and thermal electronic properties. Mathematical research on a graph’s structure yields a graph descriptor, a numerical measure. Chemical graph theory employs connectivity descriptors to analyze molecular structures, providing crucial insights into many ...
Khalil Hadi Hakami +3 more
wiley +1 more source
On the Hamiltonian Number of a Plane Graph
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj +1 more source
Improved Bounds for Some Facially Constrained Colorings
A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a proper
Štorgel Kenny
doaj +1 more source

