Standard representations of irregular finite element meshes combine vertex data (sample coordinates and node values) and connectivity (tetrahedron–vertex incidence). Connectivity specifies how the samples should be interpolated. It may be encoded as four vertex-references for each tetrahedron, which requires 128m bits where m is the number of tetrahedra in the mesh. Our ‘Grow & Fold’ format red...

A vertex-cut S is called a super if G − disconnected and it contains no isolated vertices. The super-connectivity , κ ′, the minimum cardinality over all vertex-cuts. This article provides bounds for connectivity of direct product an arbitrary graph complete K n . Among other results, we show that non-complete with girth( ) = 3 ′( ∞, then × ≤ min{ mn 6, m ( 1) + 5, 5 8}, where | V )|

For a simple connected graph G, Eccentric connectivity index denoted by ( ) c G 7 is defined as: ( ) ( ) ( ( ) ( )) c i V G G E i d i 7 , where E(i) is the eccentricity of vertex i, d(i) is the degree of vertex i and V(G) is the set of vertices of G. Eccentricity of vertex i in a graph G is the path length from verte i to vertex j that is farthest from i. In this paper, an algorithm is presente...

The problem of enumerating connected induced subgraphs a given graph is classical and studied well. It known that can be enumerated in constant time for each subgraph. In this paper, we focus on highly subgraphs. most major concept connectivity graphs vertex connectivity. For connectivity, some enumeration settings algorithms have been proposed, such as k-vertex spanning another edge-connectivi...