Results 1 to 10 of about 5,373,085 (299)
A Miniaturized Arc Shaped Near Isotropic Self-Complementary Antenna for Spectrum Sensing Applications [PDF]
Sensors, 2023 This paper presents the design of an arc-shaped near-isotropic self-complementary antenna for spectrum sensing application. An arc-shaped dipole with horizontal and vertical arms is used to achieve a near isotropic radiation pattern.
Ubaid Ur Rahman Qureshi +6 more
doaj +2 more sources
-partite self-complementary and almost self-complementary -uniform hypergraphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 A hypergraph is said to be -partite -uniform if its vertex set can be partitioned into non-empty sets so that every edge in the edge set , consists of precisely one vertex from each set , . It is denoted as or if for .
L.N. Kamble +2 more
doaj +2 more sources
Restrained Domination in Self-Complementary Graphs
Discussiones Mathematicae Graph Theory, 2021 A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S.
Desormeaux Wyatt J. +2 more
doaj +5 more sources
A self-complementary macrocycle by a dual interaction system [PDF]
Nature Communications, 2022 In nature, HIV capsid consists of single class of protein unit by self-complementarity. Here, the authors find that a molecular tweezer forms a cyclic hexamer by its continuous host-guest behavior, and constructs a large cuboctahedron by hierarchical ...
Yuta Sawanaka +3 more
doaj +2 more sources
On almost self-complementary graphs
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Primoz Potocnik, Mateja Sajna
exaly +2 more sources
Almost Self-Complementary Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2018 A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if (nk)$\
Wojda Adam Paweł
doaj +3 more sources
On separable self-complementary graphs
Discrete Mathematics, 2002 The authors consider simple finite undirected graphs. Their first result is a set of necessary and sufficient conditions for the complement \(\overline G\) of a separable graph \(G\) to be separable or disconnected. If \(H\) is a graph and \(P_4=v_1v_2v_3v_4\) is a 4-path, then the graph \(G\) obtained from \(H\cup P_4\) by joining \(v_2\) and \(v_3 ...
Atsuhiro Nakamoto +2 more
exaly +4 more sources
Local coloring of self complementary graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph .
P. Deepa +2 more
doaj +2 more sources
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jin Xu, C. K. Wong
exaly +4 more sources
Wideband Directive Self-Complementary Bowtie Antenna for Ka-band [PDF]
Journal of Electromagnetic Engineering and Science, 2022 This paper presents a novel wideband directive self-complementary bowtie antenna (SCBA) designed for Ka-band. The proposed antenna is well suited for wireless power transfer and energy harvesting of compact devices using 5G frequencies. The proposed SCBA
Hong Soo Park, Kyu Ho Cha, Sun K. Hong
doaj +1 more source