On the vector space of a-like matrices for tadpole graphs
Consider a simple undirected graph {u100000} with vertex set X. Let MatX(R) denote the R-algebra of matrices with entries in R and with the rows and columns indexed by X. Let A 2 MatX(R) denote an adjacency matrix of {u100000}. For B 2 MatX(R), B is de ned to be A-like whenever the following conditi...
Saved in:
Main Authors: | Gillesania, Chester James Kent I., Ver, Powel Christian C. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2016
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/14916 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Determinants of adjacency matrices of some graphs
by: Campena, Francis Joseph H., et al.
Published: (2006) -
Square of an oriented graph
by: Macariola, Francesca, et al.
Published: (2016) -
On k-walks in bridgeless graphs
by: Cu, Gordon Lester T.
Published: (2008) -
Verification of graph programs
by: POSKITT, Christopher M.
Published: (2012) -
On labelling harmonious graphs
by: Fabros, Roland R., et al.
Published: (1998)