<--- Back to Details
First PageDocument Content
Adjacency matrix / Bipartite graph / Graph / Directed graph / Strongly regular graph / Matching / Spectral graph theory / Bipartite double cover / Graph theory / Mathematics / Algebraic graph theory
Date: 2012-05-27 12:51:03
Adjacency matrix
Bipartite graph
Graph
Directed graph
Strongly regular graph
Matching
Spectral graph theory
Bipartite double cover
Graph theory
Mathematics
Algebraic graph theory

Skew-adjacency matrices of graphs M. Caversa,1 , S. M. Cioab˘ab,4 , S. Fallatc,2 , D. A. Gregoryd,2,∗, W. H. Haemerse , S. J. Kirklandf,3 , J. J. McDonaldg , M. Tsatsomerosg a Dept. of Mathematics and Statistics, Uni

Add to Reading List

Source URL: www.math.wsu.edu

Download Document from Source Website

File Size: 234,38 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