<--- Back to Details
First PageDocument Content
Algebraic graph theory / Matrix theory / Matrices / Linear algebra / Adjacency matrix / Strongly regular graph / Regular graph / Complete bipartite graph / Hypercube graph / Graph theory / Mathematics / Algebra
Date: 2009-02-15 06:47:27
Algebraic graph theory
Matrix theory
Matrices
Linear algebra
Adjacency matrix
Strongly regular graph
Regular graph
Complete bipartite graph
Hypercube graph
Graph theory
Mathematics
Algebra

Add to Reading List

Source URL: www.win.tue.nl

Download Document from Source Website

File Size: 76,40 KB

Share Document on Facebook

Similar Documents

Graph theory / Bipartite graphs / Planar graphs / Induced path / NP-complete problems / Parity graph

Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada

DocID: 1rsEH - View Document

Graph theory / Bipartite graphs / Graph operations / NP-complete problems / Chordal bipartite graph / Chordal graph / Distance-hereditary graph / Matching / Line graph / Split graph / Graph / Cycle

On factorial properties of chordal bipartite graphs Konrad Dabrowski∗ Vadim V. Lozin† Victor Zamaraev‡

DocID: 1rf09 - View Document

Graph theory / Mathematics / NP-complete problems / Graph coloring / Matching / Bipartite graph / Color-coding / Treewidth / Graph / Cycle / Line graph / Chromatic polynomial

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

DocID: 1r8ab - View Document

Graph theory / Graph operations / NP-complete problems / Bipartite graphs / Combinatorial optimization / Matching / Line graph / Chordal graph / Clique / Complete bipartite graph / Independent set / Cograph

New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

DocID: 1qQA2 - View Document

Graph theory / NP-complete problems / Graph operations / Graph coloring / Interval graph / Hamiltonian path / Bipartite graph / Ear decomposition / Indifference graph / Chordal graph / Cograph / Strongly chordal graph

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

DocID: 1qMfK - View Document