Sciweavers

3211 search results - page 75 / 643
» On the Grundy Number of a Graph
Sort
View
DM
2002
107views more  DM 2002»
13 years 7 months ago
Edge clique graphs and some classes of chordal graphs
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...
Márcia R. Cerioli, Jayme Luiz Szwarcfiter
ARSCOM
2006
140views more  ARSCOM 2006»
13 years 7 months ago
Expansion Properties Of Levi Graphs
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
Dominic Lanphier, C. Miller, Jason Rosenhouse, A. ...
ARSCOM
2005
94views more  ARSCOM 2005»
13 years 7 months ago
Isometrically Embedded Graphs
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
Debra L. Boutin
COMBINATORICS
2000
120views more  COMBINATORICS 2000»
13 years 7 months ago
The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
Elias M. Hagos
AIPS
2008
13 years 10 months ago
Causal Graphs and Structurally Restricted Planning
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
Hubie Chen, Omer Giménez