◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Javad B. Ebrahimi

2 papers hereh-index 26 citations5 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

collaborators

2 papers

math.CO2025

Fractional forcing number of graphs

Javad B. Ebrahimi, Babak Ghanbari

The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and Živković. The application of this problem in chemistry, as well as its interesting theoretic…

math.CO2024

Bounds on the Complete Forcing Number of Graphs

Javad B. Ebrahimi, Aref Nemayande, Elahe Tohidi

A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A compl…

◍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.