Every graph appearing in this note is a finite edge graph without loops and multiple edges. Denote by G(n, m) a graph with n vertices and ni edges . K r (t) denotes a graph with r groups of t vertices each, in which two vertices are connected if and only if they belong to different groups . By dividing n vertices into r-1 almost equal groups and connecting the points in different groups one obt...

We construct trapdoor permutations based on (sub-exponential) indistinguishability obfuscation and oneway functions, thereby providing the first candidate that is not based on the hardness of factoring. Our construction shows that even highly structured primitives, such as trapdoor permutations, can be potentially based on hardness assumptions with noisy structures such as those used in candida...

In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...

Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an  ...

Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...

Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...

a compact and sharp-rejection ultra-wideband (uwb) microstrip bandpass filter (bpf) is presented. the proposed filter is constructed with multiple-mode resonator (mmr) and split ring resonator (srr). moreover, proposed structure consists of two doublets parallel coupling gaps at each side of a microstrip ring. in comparison with some other filters, this structure shows a significantly wider pas...

Thin plate structures are more widely used in many engineering applications as one of the structural members. Generally, buckling strength of thin shell structures is the ultimate load carrying capacity of these structures. The presence of cracks in a thin shell structure can considerably affect its load carrying capacity. Hence, in this work, static buckling strength of a thin square plate wit...