Results 61 to 70 of about 156 (133)
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Discussiones 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
Split Euler Tours In 4-Regular Planar Graphs
Discussiones 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
Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]
Heliyon, 2023 Koam ANA +4 more
europepmc +1 more source
REPRESENTATIONS OF GRAPHS ON A CYLINDER*
, 2008 . A complete characterization ofthe class ofgraphs that admit a cylindric visibility representation is presented, where vertices are representedby intervals parallel to the axis ofthe cylinderand the edgescorrespond to pairs ofvisible intervals. Moreover,
Ioannis
core
Light Graphs In Planar Graphs Of Large Girth
Discussiones Mathematicae Graph Theory, 2016 A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K) degG(x) ≤ w(H, 𝒢).
Hudák Peter +3 more
doaj +1 more source
On Eggleton and Guy conjectured upper bound for the crossing number of the n-cube
, 1997 . The crossing number (G) of a graph G is the smallest integer such that there is a drawing for G with (G) crossings of edges. Let Q n denote the n--dimensional cube. Eggleton and Guy conjectured in 1970 that (Q n ) 4 n 5 32 \Gamma 2 n\Gamma2 b n
Celina Miraglia +3 more
core
On Independent Domination in Planar Cubic Graphs
Discussiones Mathematicae Graph Theory, 2019 A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S.
Abrishami Gholamreza +2 more
doaj +1 more source
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 +5 more
doaj +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 +2 more
doaj +1 more source
On polyhedral graphs and their complements. [PDF]
Aequ Math, 2022 Maffucci RW.
europepmc +1 more source