http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
MINIMUM PENDANT DOMINATING ESTRADA INDEX OF A GRAPH
AKbar Jahanbani,Ismail Naci CANGUL 장전수학회 2020 Advanced Studies in Contemporary Mathematics Vol.30 No.4
The main purpose of this paper is to introduce the con- cept of minimum pendant dominating Estrada index of a graph. First, we compute minimum pendant dominating Estrada index for complete graph, star graph, complete bipartite graph and cocktail party graph which are amongst the most widely-used graph classes. Also, upper and lower bounds for this new index are established. Finally, the rela- tions between the new Estrada index and the new type of energy are investigated.