Results 101 to 110 of about 1,442,532 (348)
On multiplicative degree based topological indices for planar octahedron networks
Chemical graph theory is a branch of graph theory in which a chemical compound is presented with a simple graph called a molecular graph. There are atomic bonds in the chemistry of the chemical atomic graph and edges. The graph is connected when there is
Dustigeer Ghulam+3 more
doaj +1 more source
On almost hypohamiltonian graphs [PDF]
A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J.
Jan Goedgebeur, Carol T. Zamfirescu
doaj +1 more source
On the planarity of Hanoi graphs
AbstractHanoi graphs are the state graphs for Tower of Hanoi problems with three or more pegs. We prove hamiltonicity and present a complete analysis of planarity of these graphs.
Daniele Parisse, Andreas M. Hinz
openaire +2 more sources
On the Diameter of Random Planar Graphs [PDF]
We show that the diameter diam(Gn) of a random labelled connected planar graph withnvertices is equal ton1/4+o(1), in probability. More precisely, there exists a constantc> 0 such that$$ P(\D(G_n)\in(n^{1/4-\e},n^{1/4+\e}))\geq 1-\exp(-n^{c\e}) $$for ε small enough andn ≥ n0(ε).
Chapuy, G.+3 more
openaire +9 more sources
Straight-line Drawability of a Planar Graph Plus an Edge
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing.
C Gutwenger+8 more
core +1 more source
Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source
Computing The Irregularity Strength of Planar Graphs
The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network ...
Hong Yang+4 more
doaj +1 more source
We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S^3, _{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of invariants. Second, if $G$ is 3-connected or contains $K_4$ as a minor, then the unique trivial embedding of $G$ is ...
Lambert-Cole, Peter, O'Donnol, Danielle
openaire +2 more sources
Matched Drawings of Planar Graphs [PDF]
A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique y-coordinate. In this paper we introduce the concept of such matched drawings, which is a relaxation of simultaneous geometric embeddings with mapping.
DI GIACOMO, Emilio+4 more
openaire +8 more sources
Deformation Behavior of La2O3‐Doped Copper during Equal Channel Angular Pressing
By additions of strengthening elements and/or structure optimization, the mechanical properties of copper can be increased while keeping favorable electric conductivity. By combining addition of La2O3 and processing by equal channel angular pressing, substructure development is achieved, leading to increase in microhardness to more than double the ...
Lenka Kunčická+2 more
wiley +1 more source