Skip to content
akaturk Academic measurement
Search

Article detail · 2019 · article

On the Domination Integrity

YÖKSİS OpenAlex
Year2019
Citations1OpenAlex
Percentile%13.3
FWCI0.01.00 = world average
Scopus (SJR)Q2
WoS (JCR)Q4

Data source split

  • YÖKSİSYÖKSİS article record
  • YÖKSİS venueInternational Journal of Foundations of Computer Science
  • Catalog match (ISSN)International Journal of Foundations of Computer Science
  • OpenAlexOpenAlex enrichment (abstract, citations, topics)
  • Semantic Scholarcitation count (not merged with OpenAlex)

Abstract

OpenAlex English

The domination integrity of graph G is defined by [Formula: see text] where [Formula: see text] denotes the order of the largest component in [Formula: see text]. This parameter is a measures of vulnerability of a graph. In this paper, we determine the domination integrity of middle graph of graph [Formula: see text], graph [Formula: see text] and graph [Formula: see text]. We also obtain some results for cartesian product and corona.

Topics

Citations

OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.

1citationsOpenAlex · cited_by_count (cache / database)

1 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).

  1. 2025 Çizgelerde Ağırlıklı Bağlama Sayısı ÜzerineCitations 0 · OpenAlex

Authors

2
  1. HÜSEYİN TOKAT 1
  2. ALPAY KIRLANGIÇ EGE ÜNİVERSİTESİ 2