On the maximal Aa -index of graphs with a prescribed number of edges
For any real number α∈[0,1]\alpha \in \left[\mathrm{0,1}], by the Aα{A}_{\alpha }-matrix of a graph GG, we mean the matrix Aα(G)=αD(G)+(1−α)A(G){A}_{\alpha }\left(G)=\alpha D\left(G)+\left(1-\alpha )A\left(G), where A(G)A\left(G) and D(G)D\left(G) are the adjacency matrix and the diagonal matrix of...
Saved in:
| Main Authors: | Chang Ting-Chung, Tam Bit-Shun |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2025-05-01
|
| Series: | Special Matrices |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/spma-2025-0036 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Decomposition of hypercube graphs into paths and cycles having k edges
by: D. Saranya, et al.
Published: (2025-05-01) -
Further study on the second status connectivity index of graphs
by: Mahdieh Azari, et al.
Published: (2025-05-01) -
Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
by: Allan Lo, et al.
Published: (2025-01-01) -
Green's graphs of a semigroup
by: Cheng Yanliang, et al.
Published: (2025-08-01) -
On the page-number of a circulant graph
by: Xiaoyuan Dong, et al.
Published: (2025-05-01)