Back to Search Start Over

Graphs with no M-alternating paths between two vertices: An update

Authors :
Dingjun Lou
Source :
Discrete Mathematics. (23):3429-3431
Publisher :
Elsevier B.V.

Abstract

In this paper, we obtain necessary and sufficient conditions for a graph G not to have an M-alternating path between two vertices in G.

Subjects

Subjects :
Discrete mathematics
Graph center
Induced path
Neighbourhood (graph theory)
Theoretical Computer Science
Combinatorics
Graph power
n-extendable graph
Independent set
Necessary and sufficient condition
Discrete Mathematics and Combinatorics
Path graph
Graph homomorphism
Perfect matching
Distance
Mathematics

Details

Language :
English
ISSN :
0012365X
Issue :
23
Database :
OpenAIRE
Journal :
Discrete Mathematics
Accession number :
edsair.doi.dedup.....93b0a1d0d04c80c3f7f861d43b4db851
Full Text :
https://doi.org/10.1016/j.disc.2010.08.001
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details