◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jianhua Tu

4 papers hereh-index 12 citations4 works total

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

author position
  • middle author2
  • last author2

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

fields
  • math.CO4
same name
  • Jianhua Tu — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

collaborators

4 papers

math.CO2026

Stability of independence polynomials of spiders

Lei Zhang, Jianhua Tu

For a graph G, let ik​(G) denote the number of independent sets of cardinality k, and let \[ I(G,z)=\sum_{k\ge0} i_k(G)z^k \] be its independence polynomial. Following Brown…

math.CO2024

Maximal independent sets in graphs with given matching number

Yongtang Shi, Jianhua Tu, Ziyuan Wang

A maximal independent set in a graph G is an independent set that cannot be extended to a larger independent set by adding any vertex from G. This paper investigates the proble…

math.CO2024

Upper bound for the number of maximal dissociation sets in trees

Ziyuan Wang, Lei Zhang, Jianhua Tu +1

Let G be a simple graph. A dissociation set of G is defined as a set of vertices that induces a subgraph in which every vertex has a degree of at most 1. A dissociation set is…

math.CO2024

The minimum number of maximal independent sets in graphs with given order and independence number

Yuting Tian, Jianhua Tu

Let MIS(G) be the set of all maximal independent sets in a graph G, and let mis(G)=∣MIS(G)∣. In this paper, we show that for any tree T with n vertices and independence n…

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