Relationship between adjacency and distance matrix of graph of diameter two
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 thi...
Main Authors: | Siti L. Chasanah, Elvi Khairunnisa, Muhammad Yusuf, Kiki A. Sugeng |
---|---|
Format: | Article |
Language: | English |
Published: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2021-12-01
|
Series: | Indonesian Journal of Combinatorics |
Subjects: | |
Online Access: | http://www.ijc.or.id/index.php/ijc/article/view/55 |
Similar Items
-
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
by: Omar Alomari, et al.
Published: (2023-01-01) -
Some New Bounds for <i>α</i>-Adjacency Energy of Graphs
by: Haixia Zhang, et al.
Published: (2023-05-01) -
On α-adjacency energy of graphs and Zagreb index
by: S. Pirzada, et al.
Published: (2021-01-01) -
On the Estrada Indices of Unicyclic Graphs with Fixed Diameters
by: Wenjie Ning, et al.
Published: (2021-09-01) -
A Lower Bound for the Distance Laplacian Spectral Radius of Bipartite Graphs with Given Diameter
by: Linming Qi, et al.
Published: (2022-04-01)