Results 51 to 60 of about 107 (89)

Computational Analysis of new Degree-based descriptors of oxide networks

Open Chemistry, 2019
Oxide networks have diverse applications in the polymer and pharmaceutical industries. Polynomials and degree-based topological indices have tendencies to correlate properties of molecular graphs.
Hussain Zafar, Munir Mobeen, Bilal Muhammad, Ameer Alam, Rafique Shazia, Kang Shin Min   +5 more
doaj   +1 more source

On polyhedral graphs and their complements. [PDF]

Aequ Math, 2022
Maffucci RW.
europepmc   +1 more source

The Crossing Number of Join of the Generalized Petersen Graph P(3, 1) with Path and Cycle

Discussiones Mathematicae Graph Theory, 2018
There are only few results concerning the crossing numbers of join of some graphs. In this paper, the crossing numbers of join products for the generalized Petersen graph P(3, 1) with n isolated vertices as well as with the path Pn on n vertices and with
Ouyang Zhang Dong, Wang Jing, Huang Yuan Qiu   +2 more
doaj   +1 more source

Financial fallout from the COVID-19 pandemic:Report from a high-volume academic neurosurgery. [PDF]

Neurochirurgie, 2022
Loganadane G, Senova S, Duportail P, Debbi K, Cherif MA, Ghith S, Tazi S, Marniche A, Gouello G, Idreceanu T, Kauv P, Varlet P, Belkacemi Y, Palfi S.   +13 more
europepmc   +1 more source

The Crossing Number of The Hexagonal Graph H3,n

Discussiones Mathematicae Graph Theory, 2019
In [C. Thomassen, Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface, Trans. Amer. Math. Soc. 323 (1991) 605–635], Thomassen described completely all (except finitely many) regular tilings of the torus S1 and the ...
Wang Jing, Ouyang Zhangdong, Huang Yuanqiu   +2 more
doaj   +1 more source

The Thickness of Amalgamations and Cartesian Product of Graphs

Discussiones Mathematicae Graph Theory, 2017
The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been ...
Yang Yan, Chen Yichao
doaj   +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

A Continuum-Tensegrity Computational Model for Chondrocyte Biomechanics in AFM Indentation and Micropipette Aspiration. [PDF]

Ann Biomed Eng, 2022
Arduino A, Pettenuzzo S, Berardo A, Salomoni VA, Majorana C, Carniel EL.   +5 more
europepmc   +1 more source

Identification of candidate metabolite biomarkers for metabolic syndrome and its five components in population-based human cohorts. [PDF]

Cardiovasc Diabetol, 2023
Shi M, Han S, Klier K, Fobo G, Montrone C, Yu S, Harada M, Henning AK, Friedrich N, Bahls M, Dörr M, Nauck M, Völzke H, Homuth G, Grabe HJ, Prehn C, Adamski J, Suhre K, Rathmann W, Ruepp A, Hertel J, Peters A, Wang-Sattler R.   +22 more
europepmc   +1 more source

ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE

Forum of Mathematics, Sigma, 2016
For each integer $d\geqslant 3$ , we obtain a characterization of all graphs in which the ball of radius
ITAI BENJAMINI, DAVID ELLIS
doaj   +1 more source