Some universal graphs
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 (...
Saved in:
Main Authors: | Bautista, Paolo Lorenzo Y., Mordeno, Mark Oyelle L. |
---|---|
Format: | text |
Published: |
Animo Repository
2009
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/11218 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
Fold thickness of some graphs
by: Campeña, Francis Joseph H., et al.
Published: (2009) -
On total and entire weightings of plane graphs and some special classes of graphs
by: Ilagan, Mark Francis M., et al.
Published: (2016) -
Notions of domination for some classses of graphs
by: Castaneda, Adrian Timothy S., et al.
Published: (2015) -
On the energy of some special classes of graphs
by: Angala, Bianca Marie P., et al.
Published: (2010) -
On the nullity of some families of r-partite graphs
by: Marcelino, Lyca DC
Published: (2020)