◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Minjie Zhang

4 papers hereh-index 11332 citations27 works total

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

author position
  • first author1
  • middle author1
  • last author2

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

fields
  • math.CO4
same name
  • Minjie Zhang — 3 papers, h 27
  • Minjie Zhang — 1 paper, h 2
  • Minjie Zhang — 1 paper, h 1
  • Minjie Zhang — 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

activity
20152025
most citedRelation between the H-rank of a mixed graph and the rank of its underlying graph

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

collaborators
Showing math.COShow all

4 papers · 1 filter

math.CO2025

A survey of edge-spectral-Turán type problems in spectral graph theory: Results, conjectures and open problems

Yuantian Yu, Huihui Zhang, Minjie Zhang

The edge-spectral-Turán type problem is also called the Brualdi-Hoffman-Turán type problem, which is a central topic in spectral graph theory, seeking to determine the maximum spec…

math.CO2018★ 2 cited

Relation between the H-rank of a mixed graph and the rank of its underlying graph

Chen Chen, Shuchao Li, Minjie Zhang

Given a simple graph G=(VG​,EG​) with vertex set VG​ and edge set EG​, the mixed graph G is obtained from G by orienting some of its edges. Let $H(\widetilde…

math.CO2015

On a conjecture for the signless Laplacian spectral radius of cacti with given matching number

Yun Shen, Lihua You, Minjie Zhang +1

A connected graph G is a cactus if any two of its cycles have at most one common vertex. Let ℓnm​ be the set of cacti on n vertices with matching number m. S.C. Li and…

math.CO2015★ 1 cited

'On the signless Laplacian spectra of k-trees'-- CORRIGENDUM

Minjie Zhang, Shuchao Li

In this paper, we use a new and correct method to determine the n-vertex k-trees with the first three largest signless Laplacian indices.

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