{
  "abstract": "Connectivity is one of important parameters for the fault tolerant of an interconnection network. In 1996, Fàbrega and Fiol proposed the concept of g-extra connectivity. A subset of vertices S is said to be a cutset if G -S is not connected. A cutset S is called an R g -cutset, where g is a non-negative integer, if every component of G -S has at least g + 1 vertices. If G has at least one R g -cutset, the g-extra connectivity of G, denoted by κ g (G), is then defined as the minimum cardinality over all R g -cutsets of G. In this paper, we first obtain the exact value of g-extra connectivity for the lexicographic product of two general graphs. Next, the upper and lower sharp bounds of g-extra connectivity for the Cartesian product of two genaral graphs are given. In the end, we apply our results on grid graphs and 2-dimensional generalized hypercubes.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 5,
  "authors": [
    {
      "name": "Zhao Wang"
    },
    {
      "name": "Yaping Mao"
    },
    {
      "name": "Sun-Yuan Hsieh"
    },
    {
      "name": "Ralf Klasing"
    },
    {
      "name": "Yuzhi Xiao"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/8g5nqwhwnbb3x.bib",
  "cited_by": 1,
  "doi": "10.1016/j.jcss.2026.103772",
  "fulltext_url": null,
  "id": "8g5nqwhwnbb3x",
  "issns": [
    "0022-0000",
    "1090-2724"
  ],
  "landing_url": "https://hal.science/hal-05747471v1",
  "language": "en",
  "licence": "CC-BY-NC-ND-4.0",
  "licence_label": "CC BY-NC-ND 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by-nc-nd/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "hal",
      "0.info"
    ],
    [
      "hal",
      "0.math"
    ],
    [
      "hal",
      "1.info.info-ds"
    ],
    [
      "hal",
      "1.math.math-co"
    ],
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W7128166915",
  "pdf_url": "https://hal.science/hal-05747471/document",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-11",
  "publisher": "Elsevier",
  "ris": "https://research.draconitic.com/paper/8g5nqwhwnbb3x.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:34Z",
      "native_id": "hal-05747471",
      "source": "hal",
      "url": "https://hal.science/hal-05747471v1"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "hal:1.math.math-co",
      "subfield": "combinatorics"
    }
  ],
  "title": "On the g-extra connectivity of graphs products",
  "title_text": "On the g-extra connectivity of graphs products",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:17:34Z",
  "url": "https://research.draconitic.com/paper/8g5nqwhwnbb3x",
  "venue": "Journal of Computer and System Sciences",
  "versions": []
}