Inverse vertex covering number of a graph

DOI10.1080/09720529.2012.10698391zbMath1350.05139OpenAlexW2028108707MaRDI QIDQ2832936

Radha R Iyer, Veerabhadra R. Kulli

Publication date: 15 November 2016

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2012.10698391

zbMATH Keywords

domination numbervertex covering numberinverse vertex covering number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Computing First Zagreb index and F-index of New C-products of Graphs

Cites Work

• Unnamed Item
• Two Bounds for the Domination Number of a Graph

This page was built for publication: Inverse vertex covering number of a graph