Results 1  10
of
33,652
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 892 (13 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
Computers and Discovery in Algebraic Graph Theory
 Edinburgh, 2001), Linear Algebra Appl
, 2001
"... We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.
Topics in Algebraic Graph Theory
"... The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra (for spectral theory) and group theory (for studying graph symmetry). These areas have links with other areas of mathematics, such as logic and harmo ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra (for spectral theory) and group theory (for studying graph symmetry). These areas have links with other areas of mathematics, such as logic
Invariance in Algebraic Graph Theory
"... Let X> √ 2 be arbitrary. Is it possible to study rightreversible, integrable categories? We show that Q is larger than â. Unfortunately, we cannot assume that I (Γ) = I. Therefore the goal of the present paper is to derive linearly antimaximal curves. 1 ..."
Abstract
 Add to MetaCart
Let X> √ 2 be arbitrary. Is it possible to study rightreversible, integrable categories? We show that Q is larger than â. Unfortunately, we cannot assume that I (Γ) = I. Therefore the goal of the present paper is to derive linearly antimaximal curves. 1
Algebraic Graph Theory Without Orientation
"... Let G be an undirected graph with vertices {v 1 , v 2 , . . . , v # } and edges {e 1 , e 2 , . . . , e # }. Let M be the # × # matrix whose ijth entry is 1 if e j is a link incident with v i , 2 if e j is a loop at v i , and 0 otherwise. The matrix obtained by orienting the edges of a loo ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Let G be an undirected graph with vertices {v 1 , v 2 , . . . , v # } and edges {e 1 , e 2 , . . . , e # }. Let M be the # × # matrix whose ijth entry is 1 if e j is a link incident with v i , 2 if e j is a loop at v i , and 0 otherwise. The matrix obtained by orienting the edges of a
Pattern vectors from algebraic graph theory
 IEEE PAMI
, 2005
"... Graph structures have proved computationally cumbersome for pattern analysis. The reason for this is that before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
Graph structures have proved computationally cumbersome for pattern analysis. The reason for this is that before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem
ON ALGEBRAIC GRAPH THEORY AND THE DYNAMICS OF INNOVATION NETWORKS
"... Abstract. We investigate some of the properties and extensions of a dynamic innovation network model recently introduced in [37]. In the model, the set of efficient graphs ranges, depending on the cost for maintaining a link, from the complete graph to the (quasi) star, varying within a well define ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. We investigate some of the properties and extensions of a dynamic innovation network model recently introduced in [37]. In the model, the set of efficient graphs ranges, depending on the cost for maintaining a link, from the complete graph to the (quasi) star, varying within a well
ALGEBRAIC GRAPH THEORY FOR THE FORMATION OF SUBOPTIMAL CYCLE BASES; AN EFFICIENT
"... Abstract – An efficient algorithm is presented for the formation of suboptimal cycle bases of graphs corresponding to sparse cycle adjacency matrices, leading to the formation of highly sparse flexibility matrices. The algorithm presented employs concepts from the algebraic graph theory, together wi ..."
Abstract
 Add to MetaCart
Abstract – An efficient algorithm is presented for the formation of suboptimal cycle bases of graphs corresponding to sparse cycle adjacency matrices, leading to the formation of highly sparse flexibility matrices. The algorithm presented employs concepts from the algebraic graph theory, together
Results 1  10
of
33,652