Independence number of graphs and line graphs of trees by means of omega invariant
DOI10.1007/S13398-020-00821-7zbMATH Open1454.05091OpenAlexW3008796987MaRDI QIDQ2174305FDOQ2174305
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
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
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)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the Zagreb indices of the line graphs of the subdivision graphs
- A note on a theorem of Erdős and Gallai
- A remark concerning graphical sequences
- A remark on the existence of finite graphs
- Seven criteria for integer sequences being graphic
- On the Sanskruti index of certain line graphs of subdivision graphs
- Existence of k-edge connected ordinary graphs with prescribed degrees
- Contributions to the theory of graphic sequences
- Realizability and uniqueness in graphs
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- On forcibly connected graphic sequences
- Reduced criteria for degree sequences
- Fekete-Szegö inequality for classes of \((p, q)\)-starlike and \((p, q)\)-convex functions
- A simple criterion on degree sequences of graphs
- A short proof of a theorem on degree sets of graphs
- The optimal \(t\)-pebbling number of a certain complete \(m\)-ary tree
- A note on graphs and rational balls
- Parallel enumeration of degree sequences of simple graphs. II
- Extremal problems on components and loops in graphs
- Neighborhood degree lists of graphs
- Graphs and degree sequences. I
- Degree sequences of join and corona products of graphs
- Optimal \(t\)-pebbling in cycles
- Algebraic structure of graph operations in terms of degree sequences
- The effect of edge and vertex deletion on omega invariant
- Omega invariant of graphs and cyclicness
- Connectedness criteria for graphs by means of omega invariant
- SPC product codes, graphs with cycles and Kostka numbers
Cited In (3)
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)
