Results 71 to 80 of about 380,403 (285)
Embedding 1-Planar Graphs in Ten Pages [PDF]
Every planar graph has a 4-page book embedding and this bound is tight. We show that every 1-planar graph, which is a graph that admits a drawing with at most one crossing per edge, has a 10-page book embedding. In addition, four pages are sometimes necessary and always sufficient if the planar skeleton, obtained from a 1-planar drawing by removing all
arxiv
Prime labelings on planar grid graphs
It is known that for any prime p and any integer n such that 1≤n≤p there exists a prime labeling on the pxn planar grid graph PpxPn.
Stephen James Curran
doaj +1 more source
Measurement of CT radiation beam width with a pencil ionization chamber and radiopaque mask
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
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao+2 more
doaj +1 more source
In vivo transit dosimetry methodology for whole breast intensity modulated radiation therapy
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
Regularity and Planarity of Token Graphs
Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G.
Carballosa Walter+3 more
doaj +1 more source
Fast simulation of planar Clifford circuits [PDF]
A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally ...
David Gosset+3 more
doaj +1 more source
Abstract Purpose Due to the tight curvature in their design, ring applicators are usually associated with large positioning errors. The standard practice to correct for these deviations based on global offsets may not be sufficient to comply with the recommended tolerance.
Leon G. Aldrovandi+3 more
wiley +1 more source
$1$-string $B_2$-VPG representation of planar graphs
In this paper, we prove that every planar graph has a 1-string $B_2$-VPG representation—a string representation using paths in a rectangular grid that contain at most two bends.
Therese Biedl, Martin Derka
doaj +1 more source
An MRI assessment of mechanisms underlying lesion growth and shrinkage in multiple sclerosis
By applying the tensor model, we analysed lesion orientation and the directionality of lesion expansion/contraction in multiple sclerosis. Each lesion is summarized as an ellipsoid, and the tensor model is applied to calculate lesion anisotropy. From the top to the bottom white matter atlas, surface‐in gradient segmentation and venous atlas used in the
Ermelinda De Meo+9 more
wiley +1 more source