Non-self-centrality in the corona product of graphs

BERBERLER Z. N., BERBERLER M. E.

UTILITAS MATHEMATICA, cilt.113, ss.109-119, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 113
  • Basım Tarihi: 2019
  • Dergi Adı: UTILITAS MATHEMATICA
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.109-119
  • Anahtar Kelimeler: Eccentricity, non-self-centered graph, non-self-centrality number, third Zagrab eccentricty index, INDEXES
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

The non-self-centrality number (NSC number for short) of a graph G is a novel graph invariant defined as follows: N(G) = Sigma(v1), (v1 is an element of V(G)) vertical bar e(v1) - e(v1)vertical bar where the summation goes over all the unordered pairs of vertices in G and e(v1) is the eccentricity of vertex v(1) in G . The third Zagreb eccentricity index of a graph G is also a novel graph invariant defined as E-3(G) = Sigma(v1v1 is an element of E(G))vertical bar e(v1) - e(v1)vertical bar E-3(G) is a good indicator for the non-self-centrality of a graph whereas N(G) is defined for better indicating the non-self-centrality of a graph. In this paper, explicit formulae are presented and algorithms that have polynomial time complexity are proposed for computing those eccentricity-related invariants for composite graphs.