Sciweavers

296 search results - page 3 / 60
» Group connectivity of certain graphs
Sort
View
ENDM
2007
114views more  ENDM 2007»
14 years 11 months ago
The Connectivity of addition Cayley graphs
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not c...
David J. Grynkiewicz, Vsevolod F. Lev, Oriol Serra
106
Voted
EJC
2010
14 years 11 months ago
Connectivity of chamber graphs of buildings and related complexes
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
Anders Björner, Kathrin Vorwerk
94
Voted
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 3 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
JCT
2008
57views more  JCT 2008»
14 years 11 months ago
Invariant boundary distributions for finite graphs
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
Guyan Robertson
98
Voted
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
15 years 6 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu