Results 41 to 50 of about 28,365 (265)
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
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
Journal of Combinatorial Theory, Series B, 1973 AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the plane F × F, with non-crossing line segments as edges. It is shown that the graph G is F-planar for some F if and only if every finite subgraph of G is planar.
openaire +2 more sources
Advanced Engineering Materials, EarlyView.ZnS‐MXene‐TiO2 nanocomposite heterojunction for photocatalytic decomposition of this methylene blue dye (MB) greatly improves light absorption, charge separation, and active site area. Two‐dimensional MXene forms nanocomposites by easily combining them with 0D (quantum dots), 1D (tube and wire), 2D (plane and sheet), and 3D (particle and lamellar ...
Latiful Kabir +7 more
wiley +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
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
Advanced Engineering Materials, EarlyView.This study demonstrates how optimizing laser power, scanning speed, and hatching distance in laser powder bed fusion can boost the productivity of Inconel 718 manufacturing by up to 29% while maintaining mechanical integrity. The work delivers a validated process window and cost–time analysis, offering industry‐ready guidelines for efficient additive ...
Amir Behjat +7 more
wiley +1 more source
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
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
Advanced Engineering Materials, EarlyView.A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 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