Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Further study on k-restricted edge connectivity and exact k-restricted edge connectivity of a graph
View through CrossRef
Inspired by the studies on conditional connectivity by Harary [ 1 ], we worked on [Formula: see text]-restricted edge connectivity of a graph [Formula: see text] [ 4 ]. The [Formula: see text]-restricted edge connectivity of a graph [Formula: see text] is the cardinality of a minimum edge-cut whose deletion disconnects the graph [Formula: see text] into components where each component has order at least [Formula: see text]. In this work, we take into account some results on [Formula: see text]-restricted edge connectivity and the novel parameter exact [Formula: see text]-restricted edge connectivity. In the definition of [Formula: see text]-restricted edge connectivity, we impose some extra constraints to achieve this parameter. In this paper, we consider some fundamental aspects of exact [Formula: see text]-restricted edge connectivity and how they relate to the [Formula: see text]-restricted edge connectivity.
World Scientific Pub Co Pte Ltd
Title: Further study on k-restricted edge connectivity and exact k-restricted edge connectivity of a graph
Description:
Inspired by the studies on conditional connectivity by Harary [ 1 ], we worked on [Formula: see text]-restricted edge connectivity of a graph [Formula: see text] [ 4 ].
The [Formula: see text]-restricted edge connectivity of a graph [Formula: see text] is the cardinality of a minimum edge-cut whose deletion disconnects the graph [Formula: see text] into components where each component has order at least [Formula: see text].
In this work, we take into account some results on [Formula: see text]-restricted edge connectivity and the novel parameter exact [Formula: see text]-restricted edge connectivity.
In the definition of [Formula: see text]-restricted edge connectivity, we impose some extra constraints to achieve this parameter.
In this paper, we consider some fundamental aspects of exact [Formula: see text]-restricted edge connectivity and how they relate to the [Formula: see text]-restricted edge connectivity.
Related Results
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...
The Restricted Edge-Connectivity of Strong Product Graphs
The Restricted Edge-Connectivity of Strong Product Graphs
The restricted edge-connectivity of a connected graph G, denoted by λ′(G), if it exists, is the minimum cardinality of a set of edges whose deletion makes G disconnected, and each ...
Bootstrapping a Biodiversity Knowledge Graph
Bootstrapping a Biodiversity Knowledge Graph
The "biodiversity knowledge graph" is a nice metaphor for connecting biodiversity data sources, but can we actually build it? Do we have sufficient linked data available? Given tha...
The quadrangle graph operator
The quadrangle graph operator
The cycle graph of a graph G is the graph [Formula: see text] whose vertices are the induced cycles of G and where two vertices are adjacent if and only if they are distinct induce...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...