Results 1  10
of
428,010
Weakly perfect graphs arising from rings, Glasg
 Math. J
"... Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this paper a new class of weakly perfect graphs arising from rings are presented and an explicit formula for the chromatic number of such graphs is given. 1. ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. A graph is called weakly perfect if its chromatic number equals its clique number. In this paper a new class of weakly perfect graphs arising from rings are presented and an explicit formula for the chromatic number of such graphs is given. 1.
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 860 (12 self)
 Add to MetaCart
Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area
CohenMacaulay graphs arising from digraphs
"... In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In particular it is shown that a directed graph is transitive iff ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In particular it is shown that a directed graph is transitive iff
The University of Florida sparse matrix collection
 NA DIGEST
, 1997
"... The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural enginee ..."
Abstract

Cited by 527 (17 self)
 Add to MetaCart
The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural
Dryad: Distributed DataParallel Programs from Sequential Building Blocks
 In EuroSys
, 2007
"... Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract

Cited by 728 (27 self)
 Add to MetaCart
Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set
Isoperimetric numbers of Cayley graphs arising from generalized dihedral group
 DEPARTMENT OF MATHEMATICS, YEUNGNAM UNIVERSITY, KYONGSAN
, 2002
"... Let n, x be positive integers satisfying 1 < x < n. Let Hn,x be a group admitting a presentation of the form 〈a, b  a n = b 2 = (ba) x = 1〉. When x = 2 the group Hn,x is the familiar dihedral group, D2n. Groups of the form Hn,x will be referred to as generalized dihedral groups. It is possibl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. It is possible to associate a cubic Cayley graph to each such group, and we consider the problem of finding the isoperimetric number, i(G), of these graphs. In section two we prove some propositions about isoperimetric numbers of regular graphs. In section three the special cases when x = 2, 3 are analyzed
On the number of realizations of certain Henneberg graphs arising in protein conformation
, 2012
"... Several application fields require finding Euclidean coordinates consistent with a set of distances. More precisely, given a simple undirected edgeweighted graph, we wish to find a realization in a Euclidean space so that adjacent vertices are placed at a distance which is equal to the correspondin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Several application fields require finding Euclidean coordinates consistent with a set of distances. More precisely, given a simple undirected edgeweighted graph, we wish to find a realization in a Euclidean space so that adjacent vertices are placed at a distance which is equal
Results 1  10
of
428,010