Results 41 to 50 of about 23,182 (295)
Journal of Algebraic Combinatorics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Starr, Colin L., Turner, Galen E. III
openaire +2 more sources
Heliyon, 2023 Hypervelocity impact in the universe can be generated by a three-stage gas gun. Achieving the desirable planarity of the flyer enlarges the experimentally effective area of the flyer under the hypervelocity condition.
Chengcheng Guo +7 more
doaj +1 more source
IEEE Microwave Magazine, 2006 The development of the broadband antenna for ultrawideband (UWB) applications such as communications, imaging, radar, and localization is discussed. UWB systems are based on transmitting and receiving impulses with extremely wide spectra. As the antennas for UWB should have broad operating bandwidths for impedance matching and high-gain radiation in ...
Cheng, Zhi Ning +5 more
openaire +3 more sources
Level-Planarity: Transitivity vs. Even Crossings [PDF]
, 2022 The strong Hanani-Tutte theorem states that a graph is planar if and only if it can be drawn such that any two edges that do not share an end cross an even number of times. Fulek et al.
Brückner, Guido +2 more
core +1 more source
Journal of Combinatorial Theory, Series A, 2018 The error in the differentiation argument has been ...
Simeon Ball, Michel Lavrauw
openaire +7 more sources
The expected sum of edge lengths in planar linearizations of trees
Journal of Language ModellingDependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges connect syntacticallydependent words.
Lluís Alemany-Puig +1 more
doaj +1 more source
Planar lattices and planar graphs
Journal of Combinatorial Theory, Series B, 1976 AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
openaire +2 more sources
Theoretical Computer Science, 2018 We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is motivated by applications in edge casing, as a $k$-gap-planar graph can be drawn crossing-free after introducing ...
Sang Won Bae 0001 +10 more
openaire +5 more sources
Line graph embedding of co-intersection graph of ideals of commutative rings
AKCE International Journal of Graphs and CombinatoricsThis research paper focuses on the co-intersection graph of a commutative ring [Formula: see text]. The co-intersection graph of [Formula: see text] denoted by [Formula: see text] is a simple graph with vertices that are non-trivial ideals of [Formula ...
Ali Al Khabyah +4 more
doaj +1 more source
Regularity and Planarity of Token Graphs
Discussiones Mathematicae Graph Theory, 2017 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