Results 41 to 50 of about 170,454 (272)
Computing The Irregularity Strength of Planar Graphs
Mathematics, 2018 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
Longer Cycles in Essentially 4-Connected Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 A planar 3-connected graph G is called essentially 4-connected if, for every 3-separator S, at least one of the two components of G − S is an isolated vertex.
Fabrici Igor +3 more
doaj +1 more source
On almost hypohamiltonian graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 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
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
On multiplicative degree based topological indices for planar octahedron networks
Main Group Metal Chemistry, 2020 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
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
Measurement of CT radiation beam width with a pencil ionization chamber and radiopaque mask
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose This study compares fan beam CT scanner radiation beam widths measured with a pencil ionization chamber‐radiopaque mask technique with commonly used film and computed radiography (CR) measurements. Methods For a given fan beam CT scanner x‐ray beam, the ionization chamber‐mask technique determines the radiation beam width by exposing a
Rani Al‐Senan +2 more
wiley +1 more source
Inverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network Graph
Proceedings of the International Conference on Applied Innovations in IT, 2023 The issues of telecommunication network engineering are considered in the context of digital flows optimal scheduling. Introduced the concept of the free-oriented network graph as an enhanced math model of the modern software defined networking ...
Victor Tikhonov +6 more
doaj +1 more source
In vivo transit dosimetry methodology for whole breast intensity modulated radiation therapy
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Background In vivo transit dosimetry using an electronic portal imaging device (EPID‐IVTD) is an important tool for verifying the accuracy of radiation therapy treatments. Despite its potential, the implementation of EPID‐IVTD in breast intensity modulated radiation therapy (IMRT) treatments has not yet been standardized, limiting its clinical
Lucia Zirone +8 more
wiley +1 more source
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
MathematicsIn order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj +1 more source