Connectedness criteria for graphs by means of omega invariant

DOI10.2298/FIL2002647SzbMATH Open1499.05102OpenAlexW3112836523MaRDI QIDQ5865641FDOQ5865641

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

• Graph theory
• Title not available (Why is that?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A remark on the existence of finite graphs
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Reduced criteria for degree sequences
• Extremal problems on components and loops in graphs

Cited In (4)

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

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)