Skolem Mean Like Labeling of Connected Seven Star Graphs

In this paper, we have connected the disjoint union of seven star graphs into a connected graph and verified that the connected seven star K1,1 ∪ K1,1∪K1,1∪K1,1∪K1,1∪K1,π∪K1,θ is a Skolem mean like graph if π-5 ≤ θ ≤ π+5.

Authors

Publication Details

Journal
Advances in Nonlinear Variational Inequalities
Published
2024-09-16
DOI
https://doi.org/10.52783/anvi.v28.1662
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Skolem Mean Like Labeling of Connected Seven Star Graphs

L. N. Narayanan
Advances in Nonlinear Variational Inequalities
Graph Labeling and Dimension Problems
article

Skolem Mean Like Labeling of Connected Seven Star Graphs

L. N. Narayanan
article en

Abstract

In this paper, we have connected the disjoint union of seven star graphs into a connected graph and verified that the connected seven star K1,1 ∪ K1,1∪K1,1∪K1,1∪K1,1∪K1,π∪K1,θ is a Skolem mean like graph if π-5 ≤ θ ≤ π+5.

Advances in Nonlinear Variational InequalitiesVol. 28(1)
Openalex Percentile: Top 81%
Graph Labeling and Dimension Problems
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.