Sciweavers

55 search results - page 2 / 11
» Cancellation properties of products of graphs
Sort
View
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 5 months ago
Zig-zag and Replacement Product Graphs and LDPC Codes
It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used ...
Christine A. Kelley, Deepak Sridhara, Joachim Rose...
ISPAN
2008
IEEE
13 years 11 months ago
Product Line Sigraphs
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...
Daniela Ferrero
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...
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
13 years 11 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 5 months ago
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
Eric Sopena