Any hereditarily finite set S can be represented as a finite pointed graph –dubbed membership graph– whose nodes denote elements of the transitive closure of {S} and whose edges model the membership relation. Membership graphs must be hyper-extensional –nodes are pairwise not bisimilar– and bisimilar nodes represent the same hereditarily finite set. It is worth to notice that the removal of eve...

Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.

Leaf area index (LAI) is an important surface biophysical parameter as an input to many process-oriented ecosystem models. Remote sensing technology provides a practical way to estimate LAI at a large spatial scale, and hence, considerable effort has been expended in developing LAI estimation models from remotely sensed imagery. LAI estimation models were usually formulated using multi-spectral...

Recall that a (hyper)graph is d-degenerate if every of its nonempty subgraphs has a vertex of degree at most d. Every d-degenerate (hyper)graph is (easily) (d + 1)colorable. A (hyper)graph is almost d-degenerate if it is not d-degenerate, but every its proper subgraph is d-degenerate. In particular, if G is almost (k − 1)-degenerate, then after deleting any edge it is k-colorable. For k ≥ 2, we...

Abstract To overcome with the computation limitation of resource-constrained wireless IoT edge devices, providing an efficient task offloading and resource allocation in distributed mobile computing environment is consider as a challenging promising solution. Hyper-heuristic recent times gaining popularity due to its general applicability same solution solve different types problems. generally ...

The star graph possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n 3)-edge fault tolerant hamiltonian laceable, (n 3)-edge fault tolerant strongly hamiltonian laceable, and (n 4)edge fault tolerant hyper hamiltonian laceable. All these ...

We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding hyper-edge. It defines a random hyper-multigraph specified by two distributions, one for the degrees of the vertices, and one for the sizes of the hyper-edges....

Let G be a simple connected molecular graph with vertex set V(G) and edge set E(G). One important modification of classical Zagreb index, called hyper Zagreb index HM(G) is defined as the sum of squares of the degree sum of the adjacent vertices, that is, sum of the terms 2 [ ( ) ( )] G G d u d v  over all the edges of G, where ( ) G d u denote the degree of the vetex u of G. In this paper, th...

in this paper rst we dene the notions of positive implicativehyper mv -ideals of types 1,2,3 and 4 in hyper mv -algebras and we investigatethe relationship between of them . then by some examples we show that thesenotions are not equivalent. finally we give some relations between these notionsand the notions of (weak) hyper mv -ideals and (weak) hyper mv -deductivesystems of hyper mv -algebras.