Results 51 to 60 of about 786,749 (367)
Broadband Compact Quasi Yagi Antenna for UHF Wireless Communication Systems with Enhanced Performance at UHF ISM Bands [PDF]
In this study, a broadband planar quasi Yagi antenna operated at ultra-high frequency (UHF) band is presented. The performance of the antenna is particularly improved for two popular UHF frequencies of 433 and 868 MHz used in several wireless ...
Y. Bakirli, A. Selek, M. Secmen
doaj
In this study, nitrogen-doped nickel graphene core cells (N-NiGR) are synthesized using the thermal chemical vapor deposition method. The structural, morphological, and chemical composition properties of N-NiGR are investigated using X-ray diffractometry
Seung Beom Kang+5 more
doaj +1 more source
On Planar Supports for Hypergraphs [PDF]
A graph G is a support for a hypergraph H=(V,S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si e S the subgraph of G induced by Si is connected. G is a planar support if it is a support and planar. Johnson and Pollak [9] proved that it is NP-complete to decide if a given hypergraph has a planar support. In contrast,
Kevin Verbeek+4 more
openaire +8 more sources
Design of Wideband Microstrip to SICL Transition for Millimeter-Wave Applications
In this communication, the design and working principle of a wideband microstrip to substrate integrated coaxial line (SICL) planar transition for millimeter-wave applications is presented.
Idury Satya Krishna, Soumava Mukherjee
doaj +1 more source
Even though the mesoporous-type perovskite solar cell (PSC) is known for high efficiency, its planar-type counterpart exhibits lower efficiency and hysteretic response.
Dong Yang+9 more
semanticscholar +1 more source
The Existence of Planar Hypotraceable Oriented Graphs [PDF]
A digraph is \emph{traceable} if it has a path that visits every vertex. A digraph $D$ is \emph{hypotraceable} if $D$ is not traceable but $D-v$ is traceable for every vertex $v\in V(D)$.
Susan van Aardt+2 more
doaj +1 more source
Planar lattices and planar graphs
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
A Planar Multifunctional Four-Port Antenna System for Sub-Urban Mobile Tablet
A planar multifunctional four-port antenna system integrated on one substrate applied in the suburban mobile tablet is presented in this paper. The types of these antennas are selected based on different functions and the interactions between them are ...
Li Ying Nie+3 more
doaj +1 more source
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
Ideal based hypergraph of a commutative ring
Let R be a commutative ring and k an integer strictly greater than 2. The k-maximal ideal hypergraph to R with vertex set the set of all k-maximal ideals in R and for distinct ideals I1, in the set is an edge of if and only if and the sum of any elements
V. C. Amritha, K. Selvakumar
doaj +1 more source