Results 61 to 70 of about 1,282,765 (250)
On the depth of a planar graph
Discrete Mathematics, 1976 AbstractIn this paper, we have defined the concept of the depth of a planar graph. We show that, if G is a simple finite planar graph with p vertices and q edges and q > 3(p − 1) − p/2s−1, then the depth of G is at least equal to s.
Vinay G. Kane, Sanat K. Basu
openaire +3 more sources
On Computation of Degree-Based Entropy of Planar Octahedron Networks
Journal of Function Spaces, 2022 Chemical graph theory is the combination of mathematical graph theory and chemistry. To analyze the biocompatibility of the compounds, topological indices are used in the research of QSAR/QSPR studies.
Tian-Le Sun +5 more
doaj +1 more source
Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases
Journal of Applied Computer Science & Mathematics, 2016 Cycle bases belong to a k-connected simple graph used both for listing and enumerating Hamiltonian cycles contained in a planar graph. Planar cycle bases have a weighted induced graph whose weight values limited to 1.
Retno MAHARESI
doaj +1 more source
Discrete Mathematics, 1997 A graph \(G\) is randomly planar if every planar embedding of every connected subgraph \(H\) of \(G\) can be extended to a planar embedding of \(G\). Intuitively, a graph is randomly planar if a planar embedding of it can be built up in any manner whatsoever.
Daniel C. Isaksen, David Petrie Moulton
openaire +3 more sources
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Sritharan +2 more
openaire +2 more sources
Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs
Sensors, 2017 Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult.
Eun-Seok Cho, Yongbin Yim, Sang-Ha Kim
doaj +1 more source
Homomorphisms of planar signed graphs to signed projective cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g1.
Reza Naserasr +2 more
doaj +1 more source
Planar 3-SAT with a Clause/Variable Cycle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In the Planar 3-SAT problem, we are given a 3-SAT formula together with its incidence graph, which is planar, and are asked whether this formula is satisfiable.
Alexander Pilz
doaj +1 more source
A Planarity Criterion for Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2015 It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive idea that with planarity there should be a linear ordering of the edges of a cocycle such that in the two ...
Kosta Došen, Zoran Petric
openaire +3 more sources
On the Synthesis of Planar Graphs with Given Properties
Кібернетика та комп'ютерні технологіїThe problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj +1 more source