Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
318 3 |
Ultima descărcare din IBN: 2022-12-13 12:41 |
Căutarea după subiecte similare conform CZU |
519.17 (67) |
Combinatorial analysis. Graph theory (114) |
SM ISO690:2012 SINGH, Omendra, GARG, Pravin, KANSAL, Neha. Some properties of maximum deficiency energy of a graph. In: Computer Science Journal of Moldova, 2021, nr. 1(85), pp. 76-95. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | |||||
Numărul 1(85) / 2021 / ISSN 1561-4042 /ISSNe 2587-4330 | |||||
|
|||||
CZU: 519.17 | |||||
MSC 2010: 05C50. | |||||
Pag. 76-95 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
The concept of maximum deficiency matrix Mdf (G) of a simple graph G is introduced in this paper. Let G = (V,E) be a simple graph of order n and let df(vi) be the deficiency of a vertex vi, i = 1, 2, . . . , n, then the maximum deficiency matrix Mdf (G) = [fij ]n×n is defined as: fij = ( max{df(vi), df(vj )}, if vivj 2 E(G) 0 , otherwise. Further, some coefficients of the characteristic polynomial (G; ) of the maximum deficiency matrix of G are obtained. The maximum deficiency energy EMdf (G) of a graph G is also introduced. The bounds for EMdf (G) are established. Moreover, maximum deficiency energy of some standard graphs is shown, and if the maximum deficiency energy of a graph is rational, then it must be an even integer. |
|||||
Cuvinte-cheie deficiency, maximum deficiency matrix, maximum deficiency eigenvalues, maximum deficiency energy |
|||||
|