Results 41 to 50 of about 992 (103)

Computation of Differential, Integral Operators and Quantitative Structure–Property Analysis of Boron α‐Icosahedral Nanosheet

open access: yesJournal of Mathematics, Volume 2025, Issue 1, 2025.
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

Rotor-Routing Induces the Only Consistent Sandpile Torsor Structure on Plane Graphs

open access: yesForum of Mathematics, Sigma, 2023
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

Analysis of the immunomodulatory properties of mycobacterium cell wall fraction on the cytokine production of peripheral blood mononuclear cells of healthy dogs

open access: yesVeterinary Dermatology, Volume 35, Issue 6, Page 595-604, December 2024.
Background – Mycobacterium cell wall fraction (MCWF) is derived from nonpathogenic Mycobacterium phlei and is used as an immunomodulatory compound in clinical practice, yet its mode‐of‐action requires further research. Objective – To evaluate the host response to MCWF in canine peripheral blood mononuclear cells (PBMCs) by using enzyme‐linked ...
Robert Ward   +9 more
wiley   +1 more source

Facial Incidence Colorings of Embedded Multigraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
Let G be a cellular embedding of a multigraph in a 2-manifold. Two distinct edges e1, e2 ∈ E(G) are facially adjacent if they are consecutive on a facial walk of a face f ∈ F(G). An incidence of the multigraph G is a pair (v, e), where v ∈ V (G), e ∈ E(G)
Jendrol’ Stanislav   +2 more
doaj   +1 more source

Construction of planar 4-connected triangulations [PDF]

open access: yes, 2014
In this article we describe a recursive structure for the class of 4-connected triangulations or - equivalently - cyclically 4-connected plane cubic ...
Brinkmann, Gunnar   +3 more
core   +2 more sources

Constructions of Large Graphs on Surfaces

open access: yes, 2013
We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $\Sigma$ and integers $\Delta$ and $k$, determine the maximum order $N(\Delta,k,\Sigma)$ of a graph embeddable in $\Sigma$ with maximum degree $\Delta$ and ...
Feria-Puron, Ramiro   +1 more
core   +1 more source

Testing reliability and validity of practitioner‐rated parental sensitivity: A novel tool for practice

open access: yesInfant Mental Health Journal: Infancy and Early Childhood, Volume 45, Issue 2, Page 234-246, March 2024.
Abstract Improving parental sensitivity is an important objective of interventions to support families. This study examined reliability and validity of parental sensitivity ratings using a novel package of an e‐learning tool and an interactive decision tree provided through a mobile application, called the OK! package.
Mirte L. Forrer   +3 more
wiley   +1 more source

On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július   +2 more
doaj   +1 more source

A Note on the Upper Bounds on the Size of Bipartite and Tripartite 1-Embeddable Graphs on Surfaces

open access: yesDiscussiones Mathematicae Graph Theory, 2023
In this note, we show sharp upper bounds of the size of simple bipartite and tripartite 1-embeddable graphs on closed surfaces.
Shibuya Hikari, Suzuki Yusuke
doaj   +1 more source

Split Euler Tours In 4-Regular Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
The construction of a homing tour is known to be NP-complete. On the other hand, the Euler formula puts su cient restrictions on plane graphs that one should be able to assert the existence of such tours in some cases; in particular we focus on split ...
Couch PJ   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy