DOIAbstract
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to the minimum degree. One of these conditions is that if d1⩾d2⩾⋯⩾dn is the degree sequence then ∑ll−1(d1+dn−1)>In−1 for 1 ⩽ l⩽ min {n2−1, dn}
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to the minimum degree. One of these conditions is that if d1⩾d2⩾⋯⩾dn is the degree sequence then ∑ll−1(d1+dn−1)>In−1 for 1 ⩽ l⩽ min {n2−1, dn}
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
Let denote the average degree, and denote the minimum degree of a graph. An edg
It is well known that in a graph, κ(G)⩽λ(G)⩽δ(G), where κ(G), λ(G) and δ(G) denote the verte...
The note contains some conditions on a graph implying that the edge connectivity is equal to the min...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
AbstractIt was proved by Chartrand that if G is a graph of order p for which the minimum degree is a...
AbstractIt is shown that if G is a graph of order p ≥ 2 such that deg u + deg v ≥ p − 1 for all pair...
AbstractIt is shown in this work that if graph G has degree sequence d1≥d2≥⋯≥dn≥2 with ∑i=1l(di+dn−i...
AbstractIn this paper we give degree sequence conditions for the equality of edge-connectivity and m...
AbstractThe old well-known result of Chartrand, Kaugars and Lick says that every k-connected graph G...
AbstractLet G be a connected graph with vertex set V(G), order n=|V(G)|, minimum degree δ and edge-c...
http://dx.doi.org/10.1017/S0004972712000330An edge-colored graph $G$ is called \textit{properly conn...
AbstractFor a connected graph G=(V,E), an edge set S⊂E is a k-restricted-edge-cut, if G-S is disconn...
In this paper, we consider the problem of constructing a minimum cost graph with a specified edge-co...
The edge-connectivity l of a connected graph is the minimum number of edges whose deletion produc...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
Let denote the average degree, and denote the minimum degree of a graph. An edg
It is well known that in a graph, κ(G)⩽λ(G)⩽δ(G), where κ(G), λ(G) and δ(G) denote the verte...
The note contains some conditions on a graph implying that the edge connectivity is equal to the min...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
AbstractIt was proved by Chartrand that if G is a graph of order p for which the minimum degree is a...
AbstractIt is shown that if G is a graph of order p ≥ 2 such that deg u + deg v ≥ p − 1 for all pair...
AbstractIt is shown in this work that if graph G has degree sequence d1≥d2≥⋯≥dn≥2 with ∑i=1l(di+dn−i...
AbstractIn this paper we give degree sequence conditions for the equality of edge-connectivity and m...
AbstractThe old well-known result of Chartrand, Kaugars and Lick says that every k-connected graph G...
AbstractLet G be a connected graph with vertex set V(G), order n=|V(G)|, minimum degree δ and edge-c...
http://dx.doi.org/10.1017/S0004972712000330An edge-colored graph $G$ is called \textit{properly conn...
AbstractFor a connected graph G=(V,E), an edge set S⊂E is a k-restricted-edge-cut, if G-S is disconn...
In this paper, we consider the problem of constructing a minimum cost graph with a specified edge-co...
The edge-connectivity l of a connected graph is the minimum number of edges whose deletion produc...
A vertex set A is n-connected in a graph G, if for every {a, b}σA there are n openly disjoint paths ...
Let denote the average degree, and denote the minimum degree of a graph. An edg
It is well known that in a graph, κ(G)⩽λ(G)⩽δ(G), where κ(G), λ(G) and δ(G) denote the verte...
Add to ORKG