Extremal problems on components and loops in graphs

DOI10.1007/s10114-018-8086-6zbMath1411.05136OpenAlexW2898078977WikidataQ129002782 ScholiaQ129002782MaRDI QIDQ1734913

Sadik Delen, Ismail Naci Cangul

Publication date: 27 March 2019

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-018-8086-6

zbMATH Keywords

connectednessdegree sequenceacyclic graphcyclic graphgraph characteristic

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (9)

Effect of edge and vertex addition on Albertson and Bell indices ⋮ Arithmetic convolution sums derived from eta quotients related to divisors of 6 ⋮ Unnamed Item ⋮ Independence number of graphs and line graphs of trees by means of omega invariant ⋮ Generalized Lucas graphs ⋮ Omega index of line and total graphs ⋮ Lucas graphs ⋮ Inverse problem for Bell index ⋮ Connectedness criteria for graphs by means of omega invariant

Cites Work

• Unnamed Item
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• On forcibly connected graphic sequences
• Contributions to the theory of graphic sequences
• Realizability and uniqueness in graphs
• Neighborhood degree lists of graphs
• A remark on the existence of finite graphs
• Graphs and degree sequences. I
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

This page was built for publication: Extremal problems on components and loops in graphs