Distance-regular graph

Results: 8



#Item
1Public Lecture, IPM-Isfahan  Professor Edwin van Dam Tilburg University, The Netherlands  Titel:

Public Lecture, IPM-Isfahan Professor Edwin van Dam Tilburg University, The Netherlands Titel:

Add to Reading List

Source URL: math.ipm.ac.ir

Language: English - Date: 2015-04-26 07:32:42
2Centrality and AIDS Stephen P. Borgatti University of South Carolina Techniques is a regular colum n devoted to techniques of data construction, m anagem ent, interpretation and analysis. C ontributions are appreciated.

Centrality and AIDS Stephen P. Borgatti University of South Carolina Techniques is a regular colum n devoted to techniques of data construction, m anagem ent, interpretation and analysis. C ontributions are appreciated.

Add to Reading List

Source URL: www.insna.org

Language: English - Date: 2014-09-27 18:32:08
3Contents Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Topics in algebraic graph theory 1 Graph spectrum . . . . . . . . . . . . . . . . . . . . . . 1.1

Contents Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Topics in algebraic graph theory 1 Graph spectrum . . . . . . . . . . . . . . . . . . . . . . 1.1

Add to Reading List

Source URL: www.ipm.ac.ir

Language: English - Date: 2011-09-28 00:50:08
4THEOREM OF THE DAY Theorem (Cameron, 1982) For any integer k > 2 there exist only finitely many distance-transitive kregular graphs. The Biggs-Smith graph is the largest distance-transitive graph that is 3-regular (every

THEOREM OF THE DAY Theorem (Cameron, 1982) For any integer k > 2 there exist only finitely many distance-transitive kregular graphs. The Biggs-Smith graph is the largest distance-transitive graph that is 3-regular (every

Add to Reading List

Source URL: www.theoremoftheday.org

Language: English - Date: 2014-02-07 05:07:16
5UniALT for Regular Language Constrained Shortest Paths on a Multi-Modal Transportation Network Dominik Kirchler1,2,3 , Leo Liberti1 , Thomas Pajor4 , and Roberto Wolfler Calvo2 1

UniALT for Regular Language Constrained Shortest Paths on a Multi-Modal Transportation Network Dominik Kirchler1,2,3 , Leo Liberti1 , Thomas Pajor4 , and Roberto Wolfler Calvo2 1

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2011-09-19 09:22:17
6San Francisco State University  Alyssa Palfreyman Adjacencies in Three-Dimensional Graphs: Matrices and Marshmallows

San Francisco State University Alyssa Palfreyman Adjacencies in Three-Dimensional Graphs: Matrices and Marshmallows

Add to Reading List

Source URL: math.sfsu.edu

Language: English - Date: 2013-01-26 03:10:48
7Computing with graphs and groups Leonard H. Soicher 1. Introduction 2. Permutation group algorithms 3. Storing and accessing a G-graph 4. Constructing G-graphs

Computing with graphs and groups Leonard H. Soicher 1. Introduction 2. Permutation group algorithms 3. Storing and accessing a G-graph 4. Constructing G-graphs

Add to Reading List

Source URL: www.maths.qmul.ac.uk

Language: English - Date: 2004-07-21 07:27:34
8

PDF Document

Add to Reading List

Source URL: public.carnet.hr

Language: English - Date: 2003-04-07 17:33:09