AGUS YASIN KURNIAWAN, 089911925
(2004)
KONSTRUKSI DIGRAPH EKSENTRIS DENGAN MATRIKS ADJACENCY.
Skripsi thesis, Universitas Airlangga.
Abstract
The objective of this thesis is to find the connection between adjacency matrix of digraph and adjacency matrix of its eccentric dib'T3ph, and algorithm for constructing eccentric digraph from digraph based on the connection.
The connection between adjacency matrix of digraph and adjacency matrix of its eccentric digraph is frnded by ascertaining the eccent ric vertex from every vertex based on adjacency matrix of digraph. Therefore, laid hold of eccentric digraph from digraph. Then acquired adjacency matrix of eccentric digraph. Adjacency matrix of eccentric. digraph from cycle digraph is transpose of adjacency matrix of the cycle digraph. Whereas the connC\."1ion between adjacency matrix of complete multipanit digraph and adjacency matrix of its eccentric digraph is divided by 3 case. First. if the number of v.ertex at every partition is
one. Second. if there is partition which the number of vertex is one and partition which the number of vertex is more than one. Thjrd, if the number of vertex at
every partition is more than one. Based on every connection above. it is piled up algorithm for constructing
eccentric digraph from digraph.
Actions (login required)
 |
View Item |
