Abstract: The (vertex) connectivity /spl kappa/ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known algorithm for finding ...

Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from node fromi to node toi. Find the smallest set ...

The census of small connected cubic vertex-transitive graphs is a joint project by Primož Potočnik, Pablo Spiga, and Gabriel Verret, where they computer all cubic, vertex transitive graphs on n ...

Abstract: The vertex cover problem is a classical graph optimization problem which remains intractable even for cubic graphs and planar graphs with maximum degree at most three. In this paper, the ...

In this paper, we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for ...

ABSTRACT: We investigate prime labeling for some graphs resulted from switching of a vertex. We discuss switching invariance of some prime graphs and prove that the graphs obtained by switching of a ...