Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

GC
2010
Springer

favoriteEmaildiscussreport

143views Applied Computing» more GC 2010»

Intriguing Sets of Vertices of Regular Graphs

13 years 9 months ago

Intriguing Sets of Vertices of Regular Graphs

Download cage.ugent.be

Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with these notions. Indeed, we show that some of the results obtained earlier can be generalized to larger classes of graphs. We also give some connections and relations with other notions and results from algebraic graph theory. One of the main tools in our study will be the Bose-Mesner algebra associated with the graph.

Bart De Bruyn, Hiroshi Suzuki

Real-time Traffic

Applied Computing | GC 2010 | General Framework | Point-line Geometries | Tight Sets |

claim paper

Related Content

» Uncover Low Degree Vertices and Minimise the Mess Independent Sets in Random Regular Graph...

» Planar embeddability of the vertices of a graph using a fixed point set is NPhard

» Reachability Problems on Regular Ground Tree Rewriting Graphs

» On Dissemination Thresholds in Regular and Irregular Graph Classes

» Identifying Codes with Small Radius in Some Infinite Regular Graphs

» NeighbourDistinguishing Edge Colourings of Random Regular Graphs

» Component structure induced by a random walk on a random graph

» On time versus size for monotone dynamic monopolies in regular topologies

» A New Algorithm for Finding Minimal CycleBreaking Sets of Turns in a Graph

Post Info
More Details (n/a)

Added	25 Jan 2011
Updated	25 Jan 2011
Type	Journal
Year	2010
Where	GC
Authors	Bart De Bruyn, Hiroshi Suzuki

Comments (0)