1-Edge contraction: Total vertex stress and confluence number

Title

1-Edge contraction: Total vertex stress and confluence number

Creator

Shiny J.; Kok J.

Description

This paper introduces certain relations between 1-edge contraction and the total vertex stress and the confluence number of a graph. A main result states that if a graph G with ?(G) = k ? 2 has an edge vivj and a ?-set CG such that vi, vj ? CG then, ?(G/vivj) = k ? 1. In general, either S(G/ei) ? S(G/ej) or S(G/ej) ? S(G/ei) is true. This observation leads to an investigation into the question: for which edge(s) ei will S(G/ei) = max{S(G/ej): ej ? E(G)} and for which edge(s) will S(G/ej) = min{S(G/e`): e` ? E(G)}? 2024 Azarbaijan Shahid Madani University.

Source

Communications in Combinatorics and Optimization, Vol-9, No. 3, pp. 527-538.

Date

2024-01-01

Publisher

Azarbaijan Shahid Madani University

Subject

confluence number; edge contraction; total vertex stress

Coverage

Shiny J., Mathematic Research Center, Mary Matha Arts and Science College, Kerala, Mananthavady, India; Kok J., City of Tshwane, South Africa, CHRIST (Deemed to be a University), Bangalore, India

Rights

Restricted Access

Relation

ISSN: 25382128

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.22049/CCO.2023.27338.1238

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85194894716&doi=10.22049%2fCCO.2023.27338.1238&partnerID=40&md5=5b3113e26a7625de5abee016d714c01b