Polinomial karakteristik matriks Antiadjacency dari Graf lingkaran berarah C n dan Graf lingkaran berarah dengan penambahan satu Chord C n t = Antiadjacency matrix characteristic polynomial of a directed cycle graph C n and directed cycle graph with one chord C n t
| Format: | Bachelors |
|---|---|
| Terbitan: |
Universitas Indonesia. Fakulats Matematika dan Ilmu Pengetahuan Alam
, 2014
|
| Subjects: | |
| Online Access: |
http://lib.ui.ac.id/file?file=digital/2016-6/20403353-S-Adi Prasinda Putra.pdf |
Daftar Isi:
- [Misalkan 𝐺(𝑉(𝐺),𝐸(𝐺)) adalah suatu graf dengan 𝑉(𝐺) yang merupakan himpunan simpul tak kosong dan 𝐸(𝐺) yang merupakan himpunan busur. Jika 𝐵 adalah matriks antiadjacency dari graf berarah 𝐺 , maka dapat dibentuk suatu polinomial karakteristik det(𝜆𝐼−𝐵(𝐺)⃗⃗⃗⃗ ). Sifat-sifat polinomial karakteristik matriks antiadjacency dari graf berarah asiklik sudah dibahas, akan tetapi sifat untuk graf berarah yang memuat subgraf lingkaran belum diketahui. Pada skripsi ini diberikan sifat-sifat polinomial karakteristik matriks antiadjacency dari graf berarah siklik, khususnya graf lingkaran berarah 𝐶𝑛⃗⃗⃗⃗ dan graf lingkaran berarah dengan penambahan satu chord 𝐶𝑛𝑡⃗⃗⃗⃗ ., Let 𝐺(𝑉(𝐺),𝐸(𝐺)) be a graph with 𝑉(𝐺) which is a nonempty set of vertices and 𝐸(𝐺) which is a set of arcs. If 𝐵 is an antiadjacency matrix of a directed graph 𝐺 , then its characteristic polynomial det(𝜆𝐼−𝐵(𝐺)⃗⃗⃗⃗ ). The properties of the characteristic polynomial of antiadjacency matrix of acyclic directed graph has been discussed. However, the properties of the directed graph contains a circle subgraph is unknown. In this thesis the properties of antiadjacency matrix characteristic polynomial of a cyclic directed graph is given, specifically for directed cycle graph 𝐶𝑛⃗⃗⃗⃗ and directed cycle graph with the addition of one chord 𝐶𝑛𝑡⃗⃗⃗⃗ . ]