OPEN-LOCATING DOMINATING NUMBER FOR FLOWER SNARKS

The problem of finding an open-locating dominating set is a variant of the domination problem where both domination and the ability to identify a certain vertex are required.The cardinality of such a dominating set is called the open-locating dominating number.The open-locating domination problem has been proven to be NP-hard in the general case.In this paper, the exact value of the old domination number is provided for the class of Flower snark graphs.

Publication Details

Journal
Matematički Vesnik
Published
2024-12-30
DOI
https://doi.org/10.57016/mv-zqfw8315
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

OPEN-LOCATING DOMINATING NUMBER FOR FLOWER SNARKS

Matematički Vesnik
graph theory and CDMA systems
article

OPEN-LOCATING DOMINATING NUMBER FOR FLOWER SNARKS

article en

Abstract

The problem of finding an open-locating dominating set is a variant of the domination problem where both domination and the ability to identify a certain vertex are required.The cardinality of such a dominating set is called the open-locating dominating number.The open-locating domination problem has been proven to be NP-hard in the general case.In this paper, the exact value of the old domination number is provided for the class of Flower snark graphs.

Matematički Vesnik
Zero hunger
Openalex Percentile: Top 77%
graph theory and CDMA systems
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

OPEN-LOCATING DOMINATING NUMBER FOR FLOWER SNARKS · Matematički Vesnik (2024) | TGRS Research Map | TGRS