Results 111 to 120 of about 786,749 (367)
Computing Planarity in Computable Planar Graphs
Graphs and Combinatorics, 2016 A graph is computable if there is an algorithm which decides whether given vertices are adjacent. Having a procedure for deciding the edge set might not help compute other properties or features of the graph, however. The goal of this paper is to investigate the extent to which features related to the planarity of a graph might or might not be ...
Oscar Levin, Taylor McMillan
openaire +3 more sources
Sensors, 2020 This article presents a compact, planar, quad-port ultra-wideband (UWB) multiple-input−multiple-output (MIMO) antenna with wide axial ratio bandwidth (ARBW).
Pawan Kumar +2 more
doaj +1 more source
2-subcoloring is NP-complete for planar comparability graphs [PDF]
arXiv, 2017 A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs, namely triangle-free planar graphs with maximum degree 4, planar perfect graphs with maximum degree 4, and planar ...
arxiv
Applied Sciences, 2020 A planar, microstrip line-fed, quad-port, multiple-input-multiple-output (MIMO) antenna with dual-band rejection features is proposed for ultra-wideband (UWB) applications.
Pawan Kumar +2 more
doaj +1 more source
Exceptional planar polynomials [PDF]
arXiv, 2014 Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many extensions of $K$; we call such polynomials exceptional planar.
arxiv
Highly efficient planar perovskite solar cells through band alignment engineering
, 2015 The simplification of perovskite solar cells (PSCs), by replacing the mesoporous electron selective layer (ESL) with a planar one, is advantageous for large-scale manufacturing.
J. C. Baena +15 more
semanticscholar +1 more source
The edge-vertex inequality in a planar graph and a bipartition for the class of all planar graphs [PDF]
arXiv, 2018 For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus we have a bipartition of all planar graphs into two disjoint class of graphs, real and complex ones.
arxiv
Stacked planar optics: an application of the planar microlens
Applied Optics, 1982 In this paper we present a new development of the distributed-index planar microlens of 2.5-3-mm focal length and 0.15 N.A. and also show that it is usable with optical components in fiber communications. We then propose a concept of stacked planar optics consisting of a stack of arrayed planar microlenses and other optical components.
Iga Kenichi +4 more
openaire +3 more sources
Additive and multiplicative loops of planar ternary rings [PDF]
, 1955 Daniel Hughes
openalex +2 more sources
Genus of total graphs from rings: A survey
AKCE International Journal of Graphs and Combinatorics, 2018 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