Domination Numbers of Graphs Containing Vertex-Disjoint Cycles in Graphs | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Domination Numbers of Graphs Containing Vertex-Disjoint Cycles in Graphs

NobleID: NI4P23W74R77S00
Persistent link: https://nobleid.org/ark:/48914/w1/20260515/BC08C5AC

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/BC08C5AC.svg?ark=w1%2F20260515%2FBC08C5AC&value=id)](https://nobleid.org/work/w1/20260515/BC08C5AC)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Omprakash Sikhwal

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy