Sciweavers

101 search results - page 4 / 21
» Grundy number and products of graphs
Sort
View
FASE
2012
Springer
12 years 1 months ago
Integration Testing of Software Product Lines Using Compositional Symbolic Execution
Software product lines are families of products defined by feature commonality and variability, with a well-managed asset base. Recent work in testing of software product lines ha...
Jiangfan Shi, Myra B. Cohen, Matthew B. Dwyer
COMBINATORICS
2000
100views more  COMBINATORICS 2000»
13 years 5 months ago
Separability Number and Schurity Number of Coherent Configurations
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
Sergei Evdokimov, Ilia N. Ponomarenko
CPC
1998
64views more  CPC 1998»
13 years 5 months ago
Isoperimetric Inequalities for Cartesian Products of Graphs
We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the ...
Fan R. K. Chung, Prasad Tetali
ARSCOM
2008
110views more  ARSCOM 2008»
13 years 4 months ago
Total Perfect Codes in Tensor Products of Graphs
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
Ghidewon Abay-Asmerom, Richard Hammack, Dewey T. T...
JGT
2010
158views more  JGT 2010»
13 years 4 months ago
Cubicity of interval graphs and the claw number
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
Abhijin Adiga, L. Sunil Chandran