◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Najibeh Shahbaznejad

2 papers hereh-index 13 citations3 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • math.CO2

identity via Semantic Scholar / OpenAlex

most citedZero Forcing sets and Power Dominating sets of cardinality at most 2

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2021

Some Families of Graphs with Small Power Domination Number

Najibeh Shahbaznejad, Adel P Kazemi, Ignacio M Pelayo

Let G be a graph with the vertex set V(G) and S be a subset of V(G). Let cl(S) be the set of vertices built from S, by iteratively applying the following propag…

math.CO2019★ 1 cited

Zero Forcing sets and Power Dominating sets of cardinality at most 2

Najibeh Shahbaznejad, Ignacio M. Pelayo, Adel P. Kazemi

Let S be a set of vertices of a graph G. Let cl(S) be the set of vertices built from S, by iteratively applying the following propagation rule: if a vertex and all but exac…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.