On the Higher Order Edge-Connectivity of Complete Multipartite Graphs

QR Code

On the Higher Order Edge-Connectivity of Complete Multipartite Graphs

Let G be a connected graph with p ≥ 2 vertices. For k = 1, 2, ..., P-1, the Kth order edge-connectivity of G, denoted by A(K} (e), is defined to be the smallest number of edges whose removal from e leaves a graph with k + 1 connected components. In this note we determine A(K} (e) for any complete...

Full description

Bibliographic Details
Main Authors:	Peng, Y. H., Chen, C. C., Koh, K. M.
Format:	Article
Language:	English English
Published:	1989
Online Access:	http://psasir.upm.edu.my/id/eprint/2765/ http://psasir.upm.edu.my/id/eprint/2765/1/On_the_Higher_Order_Edge-Connectivity_of.pdf

Similar Items

On the chromaticity of complete multipartite graphs with certain edges added
by: Lau, G. C., et al.
Published: (2008)

On the higher-order edge toughness of a graph
by: Chen, C.C., et al.
Published: (1993)

On the edge‐toughness of a graph. II
by: Peng, Y.H., et al.
Published: (1993)

On graphs without multicliqual edges
by: Lim, Chong Keang, et al.
Published: (1981)

Bounds on the order of connected domination vertex critical graphs
by: Kaemawichanurat, P., et al.
Published: (2018)

Irregular total labeling on complete bipartite graph and union complete bipartite graphs
by: Daoud, Jamal Ibrahim, et al.
Published: (2010)

Converting multilevel nonclassicality into genuine multipartite entanglement
by: Regula, Bartosz, et al.
Published: (2018)

Quantifying genuine multipartite correlations and their pattern complexity
by: Girolami, Davide, et al.
Published: (2017)

Critical review of measurement for multipartite entanglement: detection and quantification
by: Mohd, Siti munirah, et al.
Published: (2016)

Genuine multipartite nonlocality of permutationally invariant Gaussian states
by: Xu, Buqing, et al.
Published: (2017)

The Existence of Diameter-Edge-Critical Graphs
by: Almalki, Norah Saleh A
Published: (2016)

Single-row transformation of complete graphs
by: Salleh, Shahruddin Hussain, et al.
Published: (2005)

Chromatic uniqueness of certain complete tripartite graphs with some edges deleted / Lau Gee Choon and Chu Hong Heng
by: Lau, Gee Choon, et al.
Published: (2005)

Multipartite Gaussian steering: monogamy constraints and quantum cryptography applications
by: Xiang, Yu, et al.
Published: (2017)

Single-row mapping and transformation of connected graphs
by: Salleh, Shaharuddin Hussain, et al.
Published: (2007)

Connected Domination Critical Graphs
by: Kaemawichanurat, Pawaton
Published: (2015)

Chromaticity Of Bipartite Graphs With Three And Four Edges Deleted
by: Yeang , Hoong Phoy
Published: (2007)

Chromaticity of Certain 2-Connected Graphs
by: Lau, Gee Choon
Published: (2003)

Hamiltonicity of connected domination critical graphs
by: Kaemawichanurat, P., et al.
Published: (2018)

Data Mining In Network Without Higher Order Connections.
by: Sathasivam, Saratha
Published: (2009)

Generating topologies using edges and vertices in graphs and some applications
by: Abdu, Khalid Abdulkalek
Published: (2018)

Differential game with slow pursuers on the edge graph of a simplex
by: Azamov, Abdulla, et al.
Published: (2021)

Chromatic equivalence classes of some families of complete tripartite graphs
by: Chia, G. L., et al.
Published: (2014)

Packing 1-plane Hamiltonian cycles in complete geometric graphs
by: Trao, Hazim Michman, et al.
Published: (2019)

On the factor-thickness of regular graphs
by: Peng, Yee Hock, et al.
Published: (1989)

The connectivity and the static-cost-effective analysis of a shifted completely connected network
by: Ali, Mohammed N.M., et al.
Published: (2019)

On the chromatic uniqueness of certain bipartite graphs
by: Peng, Y.H.
Published: (1991)

Eccentric connectivity index of unicyclic graphs with application to cycloalkanes
by: Haoer, Raad Sehen, et al.
Published: (2015)

Comparison between atom-bond connectivity indices of graphs
by: Das, Kinkar Ch., et al.
Published: (2016)

Critical graphs with respect to total domination and connected domination
by: Kaemawichanurat, P., et al.
Published: (2016)

Effects Of 5E Guided Learning With Graphing Calculator On Form Four Students Achievement And Higher Order Thinking Skills In The Topic Graphs Of Functions II
by: Muthiah, Jeyaletchumi
Published: (2020)

An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
by: Qureshi, M.A., et al.
Published: (2010)

Atom bond connectivity index of molecular graphs of alkenes and cycloalkenes
by: Mohammed, Mohanad A., et al.
Published: (2017)

The chromaticity of s-bridge graphs and related graphs
by: Xu, Shaoji, et al.
Published: (1994)

On the atom bond connectivity index of certain trees and unicyclic graphs
by: Mohammed, Mohanad Ali, et al.
Published: (2015)

The atom bond connectivity index of some trees and bicyclic graphs
by: Mohammed, Mohanad Ali, et al.
Published: (2015)

A characterization of 3-i-critical graphs of connectivity two
by: Ananchuen, N., et al.
Published: (2017)

The exact connection between the feynman integral and a completely integrable system
by: Abdul Aziz, Zainal
Published: (2005)

Higher order weak epiderivatives and applications to duality andoptimality conditions
by: Chen, C., et al.
Published: (2009)

Evaluation of foot kinematic structure by the order of bones' and joints' edges
by: Bani Hashim, Ahmad Yusairi, et al.
Published: (2011)