Connectedness criteria for graphs by means of omega invariant

DOI10.2298/FIL2002647SzbMath1499.05102OpenAlexW3112836523MaRDI QIDQ5865641

Utkum Sanli, Feriha Celik, Sadik Delen, Ismail Naci Cangul

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

connectednessdegree sequenceacyclic graphcyclic graphgraph characteristicomega invariant

Mathematics Subject Classification ID

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

Related Items (2)

Independence number of graphs and line graphs of trees by means of omega invariant ⋮ Lucas graphs

Cites Work

• Extremal problems on components and loops in graphs
• Reduced criteria for degree sequences
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Unnamed Item
• Unnamed Item

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