Some universal graphs
College
College of Science
Department/Unit
Mathematics and Statistics Department
Document Type
Archival Material/Manuscript
Publication Date
2009
Abstract
Given a graph G with vertex set V (G) = {x1, x2, . . . , xn}, we define the adjacency matrix of G to be the matrix A(G) = [aij ] where aij = 1 if xi and xj are adjacent in G. From the set of all adjacency matrices of G, denoted by A (G), we then form the subspace spanned by this set, denoted by (A (G)). A graph with adjacency matrix H is said to be a G-descendant if H ∈ (A (G)). If G is of order n and all graphs of order n are G-descendants, we say that G is universal. In this paper, we show that complements of some universal graphs are also universal.
html
Recommended Citation
Bautista, P. Y., & Mordeno, M. L. (2009). Some universal graphs. Retrieved from https://animorepository.dlsu.edu.ph/faculty_research/11218
Disciplines
Mathematics
Keywords
Graph theory
Upload File
wf_no
