Paper Info
Title
Search in Indecomposable Graphs
Abstract
In this paper we will present some properties of indecomposable graphs, furthermore we see how a search in an indecomposable graph can compute some of these properties. Endly we will see that using this search, when the vertices of an indecomposable graph G are visited in a given order O, the vertices of the complement of G (denoted [`</font >(G)] \bar G ) can also be visited in the same order O.
Year
DOI
Venue
2002
10.1007/3-540-36379-3_8
Workshop on Graph-Theoretic Concepts in Computer Science
Keywords
Field
DocType
indecomposable graph,search in a graph.,order o,denoted g,indecomposable graphs,prime graphs
Discrete mathematics,Combinatorics,Strongly regular graph,Comparability graph,Vertex-transitive graph,Graph power,Graph homomorphism,Symmetric graph,Indecomposable module,Mathematics,Complement graph
Conference
Volume
ISSN
ISBN
2573
0302-9743
3-540-00331-2
Citations 
PageRank 
References 
1
0.36
12
Authors
1
Name
Order
Citations
PageRank
Alain Cournier128122.07