BibTex Citation Data :
@article{JM1317, author = {Amir Amir}, title = {PENGGUNAAN BEBERAPA TEORI MATRIKS DALAM TEORI GRAF}, journal = {MATEMATIKA}, volume = {13}, number = {2}, year = {2012}, keywords = {}, abstract = { In a simple graf G, two veritces u and v are called adjacent in G if \{u,v\} ia an edge of G . The adjacency matrix A of G is the n x n zero-one matrix with 1 as its (i,j)th entry when v i and v j are adjacent, and 0 as its (i,j)th entry when they are not adjacent. In this paper will be described the characteristic of characteristic polynomial of a graph. Moreover, the relationship between the characteristic polynomial of a graph with characteristic polynomial of its subgraph will also be outlined. In addition, will also be described the shape of eigenvalues and eigenvectors of certain graph. }, url = {https://ejournal.undip.ac.id/index.php/matematika/article/view/1317} }
Refworks Citation Data :
In a simple graf G, two veritces u and v are called adjacent in G if {u,v} ia an edge of G. The adjacency matrix A of G is the n x n zero-one matrix with 1 as its (i,j)th entry when vi and vj are adjacent, and 0 as its (i,j)th entry when they are not adjacent. In this paper will be described the characteristic of characteristic polynomial of a graph. Moreover, the relationship between the characteristic polynomial of a graph with characteristic polynomial of its subgraph will also be outlined. In addition, will also be described the shape of eigenvalues and eigenvectors of certain graph.
Last update:
Last update: 2024-11-07 10:54:54