The Optimal Graph Whose Least Eigenvalue is Minimal among All Graphs via 1-2 Adjacency Matrix
All graphs under consideration are finite, simple, connected, and undirected. Adjacency matrix of a graph G is 0,1 matrix A=aij=0, if vi=vj or dvi,vj≥21, if dvi,vj=1.. Here in this paper, we discussed new type of adjacency matrix known by 1-2 adjacency matrix defined as A1,2G=aij=0, if vi=vj or d...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Hindawi Limited
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/acca7c0a1b7b47e7b927ec7529ec8b2b |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!