Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Zhen-Bin Gao"'
Publikováno v:
Symmetry, Vol 13, Iss 3, p 513 (2021)
For any graph G of order p, a bijection f:V(G)→{1,2,…,p} is called a numbering of G. The strength strf(G) of a numbering f of G is defined by strf(G)=max{f(u)+f(v)|uv∈E(G)}, and the strength str(G) of a graph G is str(G)=min{strf(G)|f is a numb
Externí odkaz:
https://doaj.org/article/957d7af7b9f24969988ecd41415c7923
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 2, Pp 107-111 (2016)
Let G be a graph with vertex set V(G) and edge set E(G). A vertex labeling f:V(G)→Z2 induces an edge labeling f+:E(G)→Z2 defined by f+(xy)=f(x)+f(y), for each edge xy∈E(G). For i∈Z2, let vf(i)=|{v∈V(G):f(v)=i}| and ef(i)=|{e∈E(G):f+(e)=i}
Externí odkaz:
https://doaj.org/article/e242f23294104abfa6d9ca79fb5beaae
Publikováno v:
Acta Mathematica Sinica, English Series. 38:1185-1202
Publikováno v:
IEEE Access, Vol 8, Pp 27018-27026 (2020)
A pair of tri-band multiple-input-multiple-output (MIMO) antennas with high isolation is investigated in this paper. The proposed antenna consists of two monopole antenna elements with an edge to edge spacing of 4 mm ( $0.03~\lambda _{0}$ at 2.3 GHz)
Publikováno v:
Symmetry, Vol 13, Iss 513, p 513 (2021)
Symmetry
Volume 13
Issue 3
Symmetry
Volume 13
Issue 3
For any graph $G$ of order $p$, a bijection $f: V(G)\to [1,p]$ is called a numbering of the graph $G$ of order $p$. The strength $str_f(G)$ of a numbering $f: V(G)\to [1,p]$ of $G$ is defined by $str_f(G) = \max\{f(u)+f(v)\; |\; uv\in E(G)\},$ and th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94fd07f86f794a9a6b63c9b4147916be
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 21:647-659
Let G be a simple graph with vertex set V(G) and edge set E(G). Let ⟨ℤ2, +,*⟩ be a field with two elements. A vertex labeling f : V(G) → ℤ2 induces two edge labelings f+: E(G) → ℤ2 such that f+ (xy) = f(x) + f(y), whereas f* : E(G) →
Publikováno v:
Discrete Applied Mathematics. 211:68-78
Let G be a graph with vertex set V ( G ) and edge set E ( G ) . A labeling f : V ( G ) ź Z 2 induces an edge labeling f ź : E ( G ) ź Z 2 defined by f ź ( x y ) = f ( x ) + f ( y ) , for each edge x y ź E ( G ) . For i ź Z 2 , let v f ( i ) = |
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 2, Pp 107-111 (2016)
Let G be a graph with vertex set V ( G ) and edge set E ( G ) . A vertex labeling f : V ( G ) → Z 2 induces an edge labeling f + : E ( G ) → Z 2 defined by f + ( x y ) = f ( x ) + f ( y ) , for each edge x y ∈ E ( G ) . For i ∈ Z 2 , let v f
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 41:443-453
Let G be a graph with vertex set V(G) and edge set E(G), a vertex labeling $$f : V(G)\rightarrow \mathbb {Z}_2$$ induces an edge labeling $$ f^{+} : E(G)\rightarrow \mathbb {Z}_2$$ defined by $$f^{+}(xy) = f(x) + f(y)$$ , for each edge $$ xy\in E(G)$
Publikováno v:
Electronics
Volume 9
Issue 8
Electronics, Vol 9, Iss 1265, p 1265 (2020)
Volume 9
Issue 8
Electronics, Vol 9, Iss 1265, p 1265 (2020)
To implement efficient isolation between units of a multi-input multi-output (MIMO) antenna, a defected ground structure (DGS) has been investigated. An antenna with two elements operating at 5.8 GHz and fed by coaxial is considered. To reduce mutual