Line k-Domination in Graphs

In this paper, we present a novel concept “Line k-Domination in Graphs”. The line k-domination number is the minimum cardinality among all -dominating set of line graph derived from the graph . Throughout this investigation, we obtain various bounds on by considering different parameters of the graph G such as vertices, edges, and other different domination parameters.

Authors

Dayanand K. Vyavahare

Publication Details

Journal: Advances in Nonlinear Variational Inequalities
Published: 2025-03-04
DOI: https://doi.org/10.52783/anvi.v28.4194
Primary Topic: Advanced Graph Theory Research
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Line k-Domination in Graphs

Dayanand K. Vyavahare

Mar 4, 2025

Advances in Nonlinear Variational Inequalities

Advanced Graph Theory Research

article

Line k-Domination in Graphs

Dayanand K. Vyavahare

March 4, 2025article en

Abstract

Advances in Nonlinear Variational InequalitiesVol. 28(6s)

Openalex Percentile: Top 93%

Advanced Graph Theory Research

DOI Open Access PDF OpenAlex

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.

Line k-Domination in Graphs — Dayanand K. Vyavahare · Advances in Nonlinear Variational Inequalities (2025) | TGRS Research Map | TGRS