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

DOI10.1007/s13398-020-00821-7zbMath1454.05091OpenAlexW3008796987MaRDI QIDQ2174305

Fikriye Ersoy Zihni, Gautam Srivastava, Fatma Ozen Erdogan, Hacer Ozden, Hari M. Srivastava, Ismail Naci Cangul

Publication date: 21 April 2020

Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13398-020-00821-7

zbMATH Keywords

graph theoryindependence numberdegree sequenceline graphsomega invariant

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (1)

Omega index of line and total graphs

Cites Work

• On the Zagreb indices of the line graphs of the subdivision graphs
• A short proof of a theorem on degree sets of graphs
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• A simple criterion on degree sequences of graphs
• On forcibly connected graphic sequences
• Contributions to the theory of graphic sequences
• Realizability and uniqueness in graphs
• A note on graphs and rational balls
• Extremal problems on components and loops in graphs
• A note on a theorem of Erdős and Gallai
• Reduced criteria for degree sequences
• The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree
• Fekete-Szegö inequality for classes of \((p, q)\)-starlike and \((p, q)\)-convex functions
• SPC product codes, graphs with cycles and Kostka numbers
• Neighborhood degree lists of graphs
• A remark concerning graphical sequences
• 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
• Seven criteria for integer sequences being graphic
• The effect of edge and vertex deletion on omega invariant
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Connectedness criteria for graphs by means of omega invariant
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independence number of graphs and line graphs of trees by means of omega invariant