Khoshbakht, Zeynab (2012) On (k, D)-Maximum Indexable Graphs and (k, D)-Maximum Arithmetic Graphs. International Journal of Mathematical Combinatorics, 2. pp. 81-88. ISSN 1937 - 1055
Full text not available from this repository. (Request a copy)Abstract
A (n,m) graph G is said to be (k, d) maximum indexable graph, if its vertices can be assigned distinct integers 0, 1, 2, · · · , n - 1, so that the values of the edges, obtained as the sum of the numbers assigned to their end vertices and maximum of them can be arranged in the arithmetic progression k, k + 1, k + 2d, · · · , k + (m - 1)d and also a (n,m) graph G is said to be (k, d) maximum arithmetic graph, if its vertices can be assigned distinct non negative integers so that the values of the edges, obtained as the sum of the numbers assigned to their end vertices and maximum of them can be arranged in the arithmetic progression k, k + 1, k + 2d, · · · , k + (m - 1)d. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. In this paper we introduce some families of graphs which are (k, d)- maximum indexable and (k, d)-maximum arithmetic and also compute energies of some of the
| Item Type: | Article |
|---|---|
| Subjects: | E Mathematical Science > Mathematics |
| Divisions: | Department of > Mathematics |
| Depositing User: | C Swapna Library Assistant |
| Date Deposited: | 28 Aug 2019 06:10 |
| Last Modified: | 28 Aug 2019 06:10 |
| URI: | http://eprints.uni-mysore.ac.in/id/eprint/7213 |
Actions (login required)
 |
View Item |
