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

DOI10.1007/S13398-020-00821-7MaRDI QIDQ2174305zbMATH OpenOpenAlexFDO

Authors Hacer Ozden, Fikriye Ersoy Zihni, Fatma O. Erdogan, Gautam Srivastava, Ismail Naci Cangül, H. M. Srivastava

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 theorydegree sequenceindependence numberline graphsomega invariant

Mathematics Subject Classification ID

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

Recommendations

• Independence number and \(k\)-trees of graphs
• On \(k\)-independence in graphs with emphasis on trees
• On subgraph number independence in trees
• scientific article; zbMATH DE number 1557817
• scientific article; zbMATH DE number 6694457
• On the \(k\)-independence number of graphs
• On the \(k\)-independence number in graphs
• Independence number in n-extendable graphs
• Independence number and disjoint theta graphs
• Independence polynomials of \(k\)-tree related graphs

Cites work

• scientific article; zbMATH DE number 49719 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• A note on a theorem of Erdős and Gallai
• A note on graphs and rational balls
• A remark concerning graphical sequences
• A remark on the existence of finite graphs
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• A short proof of a theorem on degree sets of graphs
• A simple criterion on degree sequences of graphs
• Algebraic structure of graph operations in terms of degree sequences
• Connectedness criteria for graphs by means of omega invariant
• Contributions to the theory of graphic sequences
• Degree sequences of join and corona products of graphs
• Existence of k-edge connected ordinary graphs with prescribed degrees
• Extremal problems on components and loops in graphs
• Fekete-Szegö inequality for classes of \((p, q)\)-starlike and \((p, q)\)-convex functions
• Graph theory
• Graphs and degree sequences. I
• Neighborhood degree lists of graphs
• Omega invariant of graphs and cyclicness
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On forcibly connected graphic sequences
• On the Sanskruti index of certain line graphs of subdivision graphs
• On the Zagreb indices of the line graphs of the subdivision graphs
• Optimal \(t\)-pebbling in cycles
• Parallel enumeration of degree sequences of simple graphs. II
• Realizability and uniqueness in graphs
• Reduced criteria for degree sequences
• SPC product codes, graphs with cycles and Kostka numbers
• Seven criteria for integer sequences being graphic
• The effect of edge and vertex deletion on omega invariant
• The optimal t-pebbling number of a certain complete m-ary tree

Cited in

(3)

• Independence number of iterated line digraphs
• Omega invariant of graphs and cyclicness
• Omega index of line and total graphs

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

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