Results 61 to 70 of about 992 (103)
Sharp Upper Bounds on the Clar Number of Fullerene Graphs
Discussiones Mathematicae Graph Theory, 2018 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
On the Hamiltonian Number of a Plane Graph
Discussiones Mathematicae Graph Theory, 2019 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
Facial Rainbow Coloring of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +1 more source
Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]
Heliyon, 2023 Koam ANA +4 more
europepmc +1 more source
On polyhedral graphs and their complements. [PDF]
Aequ Math, 2022 Maffucci RW.
europepmc +1 more source
Chromatic number of Euclidean plane
, 2015 If the chromatic number of Euclidean plane is larger than four, but it is known that the chromatic number of planar graphs is equal to four, then how does one explain it? In my opinion, they are contradictory to each other. This idea leads to confirm the
Wang, Kai-Rui
core
Financial fallout from the COVID-19 pandemic:Report from a high-volume academic neurosurgery. [PDF]
Neurochirurgie, 2022 Loganadane G +13 more
europepmc +1 more source
UNIFORM SPANNING FORESTS OF PLANAR GRAPHS
Forum of Mathematics, Sigma, 2019 We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm.
TOM HUTCHCROFT, ASAF NACHMIAS
doaj +1 more source
The non-commuting graph of a non-central hypergroup
Open Mathematics, 2019 The aim of this paper is to construct and study the properties of a certain graph associated with a non-central hypergroup, i.e. a hypergroup having non-commutative the associated fundamental group.
Iranmanesh Mahdiyeh +2 more
doaj +1 more source
A Continuum-Tensegrity Computational Model for Chondrocyte Biomechanics in AFM Indentation and Micropipette Aspiration. [PDF]
Ann Biomed Eng, 2022 Arduino A +5 more
europepmc +1 more source