Results 71 to 80 of about 38,199 (317)

On (p, 1)-Total Labelling of Some 1-Planar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2021
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ (G) ≥
Niu Bei, Zhang Xin
doaj   +1 more source

Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows

open access: yesAdvanced 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

On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords

open access: yesDiscussiones Mathematicae Graph Theory, 2019
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-planar graph with maximum degree ∆ ≥ 8 is edge-colorable with ∆ colors if each of its 5-cycles contains ...
Sun Lin, Wu Jianliang
doaj   +1 more source

Longer Cycles in Essentially 4-Connected Planar Graphs

open access: yesDiscussiones 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

Planar 3-SAT with a Clause/Variable Cycle [PDF]

open access: yesDiscrete 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

Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators

open access: yesAdvanced Engineering Materials, EarlyView.
A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad   +6 more
wiley   +1 more source

On multiplicative degree based topological indices for planar octahedron networks

open access: yesMain 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

Recycling of NiTi Shape Memory Alloys: Fundamental and Technological Aspects of a Vacuum Induction Melting Processing Route

open access: yesAdvanced Engineering Materials, EarlyView.
The present study investigates recycling of NiTi shape memory alloys via vacuum induction melting. An ingot was synthesized from elemental Ni and Ti and subjected to three subsequent remelting cycles. Remelting increases process durations and impurity levels and adversely affects microstructures and functional properties.
Sakia Sophia Noorzayee   +7 more
wiley   +1 more source

On the Synthesis of Planar Graphs with Given Properties

open access: yesКібернетика та комп'ютерні технології
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

On almost hypohamiltonian graphs [PDF]

open access: yesDiscrete 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

Home - About - Disclaimer - Privacy