On the second minimizing graph in the set of complements of trees
Let be a graph of order and be its adjacency matrix such that if is adjacent to and otherwise, where . In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of its adjacency matrix attains the minimum (or second minimum). In this paper, we charact...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.11.005 |
| id |
doaj-056fa68b8aae4285bfd91cab7d250861 |
|---|---|
| record_format |
Article |
| spelling |
doaj-056fa68b8aae4285bfd91cab7d2508612020-11-25T03:25:19ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002019-12-0116325826410.1016/j.akcej.2018.11.00512092689On the second minimizing graph in the set of complements of treesM. Javaid0Department of Mathematics, School of Science, University of Management and Technology (UMT)Let be a graph of order and be its adjacency matrix such that if is adjacent to and otherwise, where . In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of its adjacency matrix attains the minimum (or second minimum). In this paper, we characterize the second minimizing graph among all graphs which belong to the set of complements of the trees.http://dx.doi.org/10.1016/j.akcej.2018.11.005adjacency matrixleast eigenvaluecomplement of trees |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
M. Javaid |
| spellingShingle |
M. Javaid On the second minimizing graph in the set of complements of trees AKCE International Journal of Graphs and Combinatorics adjacency matrix least eigenvalue complement of trees |
| author_facet |
M. Javaid |
| author_sort |
M. Javaid |
| title |
On the second minimizing graph in the set of complements of trees |
| title_short |
On the second minimizing graph in the set of complements of trees |
| title_full |
On the second minimizing graph in the set of complements of trees |
| title_fullStr |
On the second minimizing graph in the set of complements of trees |
| title_full_unstemmed |
On the second minimizing graph in the set of complements of trees |
| title_sort |
on the second minimizing graph in the set of complements of trees |
| publisher |
Taylor & Francis Group |
| series |
AKCE International Journal of Graphs and Combinatorics |
| issn |
0972-8600 |
| publishDate |
2019-12-01 |
| description |
Let be a graph of order and be its adjacency matrix such that if is adjacent to and otherwise, where . In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of its adjacency matrix attains the minimum (or second minimum). In this paper, we characterize the second minimizing graph among all graphs which belong to the set of complements of the trees. |
| topic |
adjacency matrix least eigenvalue complement of trees |
| url |
http://dx.doi.org/10.1016/j.akcej.2018.11.005 |
| work_keys_str_mv |
AT mjavaid onthesecondminimizinggraphinthesetofcomplementsoftrees |
| _version_ |
1724597609359736832 |