Results 51 to 60 of about 1,605,869 (375)
Dual Circularly Polarized Planar Four-Port MIMO Antenna with Wide Axial-Ratio Bandwidth
A broadband compact-sized planar four-port multiple-input–multiple-output (MIMO) antenna with polarization diversity is presented. The proposed dual circularly polarized (CP) MIMO antenna consists of four G-shaped monopole elements, two of which are left-
Sachin Kumar+4 more
doaj +1 more source
Microwave Planar Resonant Solutions for Glucose Concentration Sensing: A Systematic Review
The measurement of glucose concentration finds interesting potential applications in both industry and biomedical contexts. Among the proposed solutions, the use of microwave planar resonant sensors has led to remarkable scientific activity during the ...
Carlos G. Juan+3 more
doaj +1 more source
Conductance through the disclination dipole defect in metallic carbon nanotubes
The electronic transport properties of a metallic carbon nanotube with the five-seven disclination pair characterized by a lattice distortion vector are investigated.
D V Kolesnikov+4 more
core +1 more source
Planar functions over fields of characteristic two [PDF]
Classical planar functions are functions from a finite field to itself and give rise to finite projective planes. They exist however only for fields of odd characteristic.
Schmidt, Kai-Uwe, Zhou, Yue
core +1 more source
We will determine all infinite $2$-locally finite groups as well as infinite $2$-groups with planar subgroup graph and show that infinite groups satisfying the chain conditions containing an involution do not have planar embeddings.
Erfanian, Ahmad+2 more
core +1 more source
A typical graph structure of a ring [PDF]
The zero-divisor graph of a commutative ring R with respect to nilpotent elements is a simple undirected graph $Gamma_N^*(R)$ with vertex set Z_N(R)*, and two vertices x and y are adjacent if and only if xy is nilpotent and xy is nonzero, where Z_N(R)={x
R. Kala , S. Kavitha
doaj
Genus of total graphs from rings: A survey
Let be a commutative ring. The total graph of is the undirected graph with vertex set and two distinct vertices and are adjacent if is a zero divisor in In this paper, we present a survey of results on the genus of and three of its generalizations.
T. Tamizh Chelvam, T. Asir
doaj +1 more source
Morphing Planar Graph Drawings Optimally [PDF]
We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound.
C. Erten+10 more
core +1 more source
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+10 more
openaire +6 more sources
Contact Representations of Graphs in 3D
We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected planar graph, there
A Bezdek+17 more
core +1 more source