Results 41 to 50 of about 380,403 (285)
Volume staging for arteriovenous malformation SRS treatment using VMAT
Abstract Volume staging involves dividing the target volume into smaller parts and treating each part separately. In this study, the feasibility of volume‐staged stereotactic radiosurgery (VS‐SRS) on a linear accelerator using volumetric modulated arc therapy (VMAT) and a frameless patient positioning system is investigated.
Claudia Mendez, Ermias Gete
wiley +1 more source
Long cycles and spanning subgraphs of locally maximal 1‐planar graphs [PDF]
A graph is 1‐planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges induce a complete ...
Igor Fabrici+5 more
semanticscholar +1 more source
The study presents the mechanical and in situ sensing performance of digital light processing‐enabled 2D lattice nanocomposites under monotonic tensile and repeated cyclic loading, and provides guidelines for the design of architectures suitable for strain sensors and smart lightweight structures.
Omar Waqas Saadi+3 more
wiley +1 more source
Non-1-Planarity of Lexicographic Products of Graphs
In this paper, we show the non-1-planarity of the lexicographic product of a theta graph and K2. This result completes the proof of the conjecture that a graph G ◦ K2 is 1-planar if and only if G has no edge belonging to two cycles.
Matsumoto Naoki, Suzuki Yusuke
doaj +1 more source
The small intersection graph of filters of a bounded distributive lattice [PDF]
Let $L$ be a lattice with $1$ and $0$. The small intersection graph of filters of $L$, denoted by $\Gamma(L)$, is defined to be a graph whose vertices are in one to one correspondence with all non-trivial filters of $L$ and two distinct vertices are ...
Shahabaddin Ebrahimi Atani+2 more
doaj +1 more source
Computational Study on a PTAS for Planar Dominating Set Problem
The dominating set problem is a core NP-hard problem in combinatorial optimization and graph theory, and has many important applications. Baker [JACM 41,1994] introduces a k-outer planar graph decomposition-based framework for designing polynomial time ...
Qian-Ping Gu, Marjan Marzban
doaj +1 more source
About Structure of Graph Obstructions for Klein Surface with 9 Vertices
The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of (-transformations of the graphs.
V.I. Petrenjuk, D.A. Petrenjuk
doaj +1 more source
Bondage Number of 1-Planar Graph
The bondage number of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that for a 1-planar graph G.
Qiaoling Ma, Sumei Zhang, Jihui Wang
semanticscholar +1 more source
Strongly Multiplicative Labeling of Diamond Graph, Generalized Petersen Graph, and Some Other Graphs
A finite, simple graph of order k is said to be a strongly multiplicative graph when all vertices of the graph are labeled by positive integers 1,2,3,…,k such that the induced edge labels of the graph, obtained by the product of labels of end vertices of
Sumiya Nasir+5 more
doaj +1 more source
Hosoya Polynomial, Wiener Index, Coloring and Planar of Annihilator Graph of Zn [PDF]
Let R be a commutative ring with identity. We consider ΓB(R) an annihilator graph of the commutative ring R. In this paper, we find Hosoya polynomial, Wiener index, Coloring, and Planar annihilator graph of Zn denote ΓB(Zn) , with n= pm or n=pmq, where p,
Mohammed Ahmed+2 more
doaj +1 more source