<--- Back to Details
First PageDocument Content
Strongly regular graph / Distance-regular graph / Regular graph / Clebsch graph / Adjacency matrix / Graph theory / Algebraic graph theory / Spectral graph theory
Date: 2011-09-28 00:50:08
Strongly regular graph
Distance-regular graph
Regular graph
Clebsch graph
Adjacency matrix
Graph theory
Algebraic graph theory
Spectral graph theory

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

Add to Reading List

Source URL: www.ipm.ac.ir

Download Document from Source Website

File Size: 114,14 KB

Share Document on Facebook

Similar Documents

Lecture 24  Spectral Graph Theory Strongly Regular Graphs, part 2 November 20, 2009

Lecture 24 Spectral Graph Theory Strongly Regular Graphs, part 2 November 20, 2009

DocID: 1sgvg - View Document

Spectral Graph Theory  Lecture 23 Strongly Regular Graphs, part 1 Daniel A. Spielman

Spectral Graph Theory Lecture 23 Strongly Regular Graphs, part 1 Daniel A. Spielman

DocID: 1s4GT - View Document

Spectral Graph Theory and its Applications  Lecture 12 Algebraic Graphs Lecturer: Daniel A. Spielman

Spectral Graph Theory and its Applications Lecture 12 Algebraic Graphs Lecturer: Daniel A. Spielman

DocID: 1qpJG - View Document

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact it is strongly

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact it is strongly

DocID: 1lMqi - View Document

PDF Document

DocID: 17iS6 - View Document