Sifat Nilai Eigen Matriks Antiadjacency dari Graf Simetrik
(1) 
(*) Corresponding Author
Abstract
Antiadjacency matrix is one of the ways to represent a directed graph . Let G be a directed graph with V(G)={v1, v2, . . ., vn} . The adjacency matrix of G is a matrix A=(aij) of order n x n , with aij=1 if there is an edge from vi to vj , for i not equal j , otherwise aij will equals 0. The matrix B= J - A is called the antiadjacency matrix of G, with J is a matrix of order n x n with all entries equal to 1. In this paper, it will show characteristic of eigenvalue of antiadjacency matrix of symmetric graph.
Keywords : antiadjacency matrix, a symmetric graph, characteristic of eigenvalue
Full Text:
PDFDOI: http://dx.doi.org/10.30998/faktorexacta.v10i2.1284
Refbacks
- There are currently no refbacks.
![DOAJ](https://i.imgur.com/iNSkAM1.png)
![Garuda](https://garuda.kemdikbud.go.id/assets/img/garuda1.png)
![ISSN BRIN](https://upload.wikimedia.org/wikipedia/commons/d/dd/Alt_Logo_BRIN.png)
![sinta](https://sinta.kemdikbud.go.id/public/assets/img/brand_sinta.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
![pkp index](https://i.imgur.com/gkFSqQh.png)