Acharya and Hegde have introduced the notion of strongly k-indexable graphs: A (p, q)-graph G is said to be strongly k-indexable if its vertices can be assigned distinct integers 0, 1, 2, ..., p − 1 so that the values of the edges, obtained as the sums of the numbers assigned to their end vertices can be arranged as an arithmetic progression k, k+ 1, k + 2, ..., k + (q − 1). Such an assignment ...

A (p, q)-graph G is (a, d)-edge antimagic total if there exists a bijection f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2, . . . , p} and the edge labels are {p+ 1, p+ 2, . . . ,...

Let G be a connected graph with minimum degree δ and edgeconnectivity λ. A graph is maximally edge-connected if λ = δ, and it is superedge-connected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree. In this paper, we show that a connected graph or a connected triangle-free graph is maximally edge-connected or sup...

The purpose of this study was to analyze sharpshooter fauna in a five-year-old 'Westin' sweet orange orchard. Yellow sticky traps were placed on the edge of a forest, and on the periphery and inside the citrus stand. The traps were evaluated fortnightly, for three years. The most frequent species were Acrogonia citrina Marucci & Cavichioli, Bucephalogonia xanthophis (Berg), and Oncometopia faci...

Accurate edge reconstruction is critical for depth map super resolution (SR). Therefore, many traditional SR methods utilize maps to guide SR. However, it difficult predict accurate from low (LR) maps. In this paper, we propose a deep guided method, which includes an prediction subnetwork and subnetwork. The takes advantage of the hierarchical representation color images produce maps, promote p...

A connected graph is said to be super edge-connected if every minimum edge-cut isolates a vertex. The restricted edge-connectivity λ′ of a connected graph is the minimum number of edges whose deletion results in a disconnected graph such that each connected component has at least two vertices. A graph G is called λ′-optimal if λ′(G) = min{dG(u)+dG(v)−2 : uv is an edge in G}. This paper proves t...

Explicit expressions of the restricted edge connectivity of the Cartesian product of regular graphs are presented; some sufficient conditions for regular Cartesian product graphs to be maximally or super restricted edge connected are obtained as a result.