WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Applied Mathematics-A Journal of Chinese Universities
  2. Applied Mathematics-A Journal of Chinese Universities : Volume 30
  3. Applied Mathematics-A Journal of Chinese Universities : Volume 30, Issue 2, June 2015
  4. A result on quasi k-connected graphs
Loading...

Please wait, while we are loading the content...

Applied Mathematics-A Journal of Chinese Universities : Volume 32
Applied Mathematics-A Journal of Chinese Universities : Volume 31
Applied Mathematics-A Journal of Chinese Universities : Volume 30
Applied Mathematics-A Journal of Chinese Universities : Volume 30, Issue 4, December 2015
Applied Mathematics-A Journal of Chinese Universities : Volume 30, Issue 3, September 2015
Applied Mathematics-A Journal of Chinese Universities : Volume 30, Issue 2, June 2015
Modified two-grid method for solving coupled Navier-Stokes/Darcy model based on Newton iteration
Distribution function estimates by Wasserstein metric and Bernstein approximation for C $^{−1}$ functions
The construction and approximation of feedforward neural network with hyperbolic tangent function
A new test on the conditional capital asset pricing model
On the Markov-dependent risk model with tax
The maxima and sums of multivariate non-stationary Gaussian sequences
Exponential martingale for compound Poisson process with latent variable and its applications
Functional sample path properties of subsequence’s C-R increments for a Wiener process in H¨older norm
Robust construction of minimal surface from general initial mesh
A result on quasi k-connected graphs
Applied Mathematics-A Journal of Chinese Universities : Volume 30, Issue 1, March 2015
Applied Mathematics-A Journal of Chinese Universities : Volume 29
Applied Mathematics-A Journal of Chinese Universities : Volume 28
Applied Mathematics-A Journal of Chinese Universities : Volume 27
Applied Mathematics-A Journal of Chinese Universities : Volume 26
Applied Mathematics-A Journal of Chinese Universities : Volume 25
Applied Mathematics-A Journal of Chinese Universities : Volume 24
Applied Mathematics-A Journal of Chinese Universities : Volume 23
Applied Mathematics-A Journal of Chinese Universities : Volume 22
Applied Mathematics-A Journal of Chinese Universities : Volume 21
Applied Mathematics-A Journal of Chinese Universities : Volume 20
Applied Mathematics-A Journal of Chinese Universities : Volume 19
Applied Mathematics-A Journal of Chinese Universities : Volume 18
Applied Mathematics-A Journal of Chinese Universities : Volume 17
Applied Mathematics-A Journal of Chinese Universities : Volume 16
Applied Mathematics-A Journal of Chinese Universities : Volume 15
Applied Mathematics-A Journal of Chinese Universities : Volume 14
Applied Mathematics-A Journal of Chinese Universities : Volume 13
Applied Mathematics-A Journal of Chinese Universities : Volume 12

Similar Documents

...
Contractible edges in some k-connected graphs

Article

...
On connected factors inK 1,3-free graphs

Article

...
Removable edges in a spanning tree of a k-connected graph

Article

...
On hamiltonicity of 2-connected claw-free graphs

Article

...
K-Factors and Hamilton Cycles in Graphs

Article

...
Removable edges in cycles of a k-connected graph

Article

...
Note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs

Article

...
On k-diameter of k-connected graphs

Article

...
Every 3-connected {K $_{1,3}$,N $_{3,3,3}$}-free graph is Hamiltonian

Article

A result on quasi k-connected graphs

Content Provider Springer Nature Link
Author Yang, Ying qiu
Copyright Year 2015
Abstract Let G be a k-connected graph, and T be a subset of V (G). If G-T is not connected, then T is said to be a cut-set of G. A k-cut-set T of G is a cut-set of G with |T| = k. Let T be a k-cut-set of a k-connected graph G. If G - T can be partitioned into subgraphs G $_{1}$ and G $_{2}$ such that |G $_{1}$| ≥ 2, |G $_{2}$| ≥ 2, then we call T a nontrivial k-cut-set of G. Suppose that G is a (k -1)-connected graph without nontrivial (k -1)-cut-set. Then we call G a quasi k-connected graph. In this paper, we prove that for any integer k ≥ 5, if G is a k-connected graph without K $^{−}$ $_{4}$, then every vertex of G is incident with an edge whose contraction yields a quasi k-connected graph, and so there are at least $$\frac{{|V(G)|}}{2}$$ edges of G such that the contraction of every member of them results in a quasi k-connected graph.
Starting Page 245
Ending Page 252
Page Count 8
File Format PDF
ISSN 10051031
Journal Applied Mathematics-A Journal of Chinese Universities
Volume Number 30
Issue Number 2
e-ISSN 19930445
Language English
Publisher Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Publisher Date 2015-06-09
Publisher Place Hangzhou
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Component k-connected graph quasi k-connected graph Mathematics Applications of Mathematics
Content Type Text
Resource Type Article
Subject Applied Mathematics
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...