Runze Wang

collaborators

4 papers

math.CO2025

Strong hub cover pebbling number

Runze Wang

In a graph $G$ , we define a set of vertices to be a \emph{strong hub set} if for any two vertices in $G$ , we can find a path between them whose internal vertices are all in this se…

math.CO2025

Discrete isoperimetric inequalities on the strong products of paths

Runze Wang

For a graph $G = (V, E)$ and a nonempty set $S \subseteq V$ , the \emph{vertex boundary} of $S$ , denoted by $\partial_{G} (S)$ , is defined to be the set of vertices that are not in $S$ b…

math.CO2025

On Relative Ordered TurÃ¡n Density

Dylan King, Bernard LidickÃ½, Minghui Ouyang +3

For an ordered graph $F$ , denote the TurÃ¡n density by $I ¨ (F)$ . The relative TurÃ¡n density, denoted by $I ¨ (F)$ , is the supremum over $I^\pm \in [0, 1]$ such that every ordered grap…

math.CO2025

New developments on graph sum index

Dheer Noal Desai, Runze Wang

In a graph, we assign distinct integers to the vertices, and take the sum of two integers if they are on two adjacent vertices. The minimum possible number of different sums is the…