University of Memphis

output

19942026

most citedThe phase transition in inhomogeneous random graphs

554 citations

Showing 2013Show all

19 papers · 1 filter

math.FA2013

Perturbations of frames

Dongyang Chen, Lei Li, Bentuo Zheng

In this paper, we give some sufficient conditions under which perturbations preserve Hilbert frames and near-Riesz bases. Similar results are also extended to frame sequences, Ries…

math.CO2013

Disjoint induced subgraphs of the same order and size

Béla Bollobás, Teeradej Kittipassorn, Bhargav Narayanan +1

For a graph $G$ , let $f (G)$ be the largest integer $k$ for which there exist two vertex-disjoint induced subgraphs of $G$ each on $k$ vertices, both inducing the same number of edg…

math.CO2013★ 1 cited

Separating path systems

Victor Falgas-Ravry, Teeradej Kittipassorn, Dániel Korándi +2

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$ -vertex graph admits a separating path system…

math.CO2013★ 8 cited

The Robber Locating game

John Haslegrave, Richard A. B. Johnson, Sebastian Koch

We consider a game in which a cop searches for a moving robber on a graph using distance probes, studied by Carragher, Choi, Delcourt, Erickson and West, which is a slight variatio…

math.CO2013

An asymptotically tight bound on the Q-index of graphs with forbidden cycles

V. Nikiforov

Let G be a graph of order n and let q(G) be that largest eigenvalue of the signless Laplacian of G. In this note it is shown that if k>1 and q(G)>=n+2k-2, then G contains cycles of…

math.CO2013

Maxima of the Q-index: degenerate graphs

V. Nikiforov

Let $G$ be a $k$ -degenerate graph of order $n .$ It is well-known that $G$ has no more edges than $S_{n, k},$ the join of a complete graph of order $k$ and an independent set of ord…