Connectedness criteria for graphs by means of omega invariant

DOI10.2298/FIL2002647SMaRDI QIDQ5865641zbMATHOpenAlexFDO

Authors Utkum Sanli, Feriha Celik, Sadik Delen, Ismail Naci Cangül

Publication date 9 June 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/fil2002647s

zbMATH Keywords

degree sequenceconnectednessacyclic graphcyclic graphgraph characteristicomega invariant

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Enumeration in graph theory (05C30) Connectivity (05C40)

Cites work

• scientific article; zbMATH DE number 49719 (Why is no real title available?)
• A remark on the existence of finite graphs
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Extremal problems on components and loops in graphs
• Graph theory
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Reduced criteria for degree sequences

Cited in

(4)

• Lucas graphs
• Connectedness of invariant sets of graph-directed IFS
• The effect of edge and vertex deletion on omega invariant
• Independence number of graphs and line graphs of trees by means of omega invariant

This page was built for publication: Connectedness criteria for graphs by means of omega invariant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865641)