A super edge-magic labeling of a graph G = (V, E) of order p and size q is a bijection f : V ∪E → {i} i=1 such that (1) f(u)+ f(uv)+ f(v) = k ∀uv ∈ E and (2) f(V ) = {i}pi=1. Furthermore, when G is a linear forest, the super edge-magic labeling of G is called strong if it has the extra property that if uv ∈ E(G), u′, v′ ∈ V (G) and dG(u, u′) = dG(v, v′) < +∞, then f(u) + f(v) = f(u′) + f(v′). I...

Nash-Williams proved that the edges of a k-edge connected (undirected) graph can be oriented such that the resulting directed graph is ⌊ 2 ⌋-edge connected. A long-standing goal in the area is to obtain analogous results for other types of connectivity, such as node connectivity, element connectivity, and hypergraph edge connectivity. We focus on two special classes of graphs, namely, incidence...

Abstract In an isolate-free graph

A graph G = (V, E) is called weakly four-connected if G is 4-edge-connected and G − x is 2-edge-connected for all x ∈ V . We give sufficient conditions for the existence of ‘splittable’ vertices of degree four in weakly four-connected graphs. By using these results we prove that every minimally weakly fourconnected graph on at least four vertices contains at least three ‘splittable’ vertices of...

It was proved that every 3-connected bipartite graph admits a vertex-coloring S-edge-weighting for S = {1, 2} (H. Lu, Q. Yu and C. Zhang, Vertex-coloring 2-edge-weighting of graphs, European J. Combin., 32 (2011), 22-27). In this paper, we show that every 2-connected and 3-edge-connected bipartite graph admits a vertex-coloring S-edgeweighting for S ∈ {{0, 1}, {1, 2}}. These bounds we obtain ar...