Open AccessThe effect of edge and vertex deletion on omega invariant
Author(s) -
Sadık Delen,
Müge Togan,
Aysun Yurttaş Güneş,
Uğur Ana,
İsmaıl Nacı Cangül
Publication year - 2020
Publication title -
applicable analysis and discrete mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.69
H-Index - 26
eISSN - 2406-100X
pISSN - 1452-8630
DOI - 10.2298/aadm190219046d
Subject(s) - mathematics , combinatorics , realizability , omega , social connectedness , discrete mathematics , invariant (physics) , vertex (graph theory) , euler characteristic , graph , algorithm , psychology , physics , quantum mechanics , mathematical physics , psychotherapist
Recently the first and last authors defined a new graph characteristic called omega related to Euler characteristic to determine several topological and combinatorial properties of a given graph. This new characteristic is defined in terms of a given degree sequence as a graph invariant and gives a lot of information on the realizability, number of realizations, connectedness, cyclicness, number of components, chords, loops, pendant edges, faces, bridges etc. of the family of realizations. In this paper, the effect of the deletion of vertices and edges from a graph on omega invariant is studied.