Indonesian Journal of Combinatorics
Vol 5, No 2 (2021)

Relationship between adjacency and distance matrix of graph of diameter two

Siti L. Chasanah (Unknown)
Elvi Khairunnisa (Unknown)
Muhammad Yusuf (Unknown)
Kiki A. Sugeng (Universitas Indonesia)



Article Info

Publish Date
28 Dec 2021

Abstract

The relationship among every pair of vertices in a graph can be represented as a matrix, such as in adjacency matrix and distance matrix. Both adjacency and distance matrices have the same property. Adjacency and distance matrices are both symmetric matrix with diagonals entries equals to 0.  In this paper, we discuss relationships between adjacency matrix and distance matrix of a graph of diameter two, which is D=2(J-I)-A. From this relationship, we  also determine the value of the determinant matrix A+D and the upper bound of determinant of matrix D.

Copyrights © 2021






Journal Info

Abbrev

ijc

Publisher

Subject

Computer Science & IT Decision Sciences, Operations Research & Management

Description

Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics. IJC is published by the Indonesian ...