#### Filter Results:

#### Publication Year

2009

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this article, we first show that every 3-edge-connected graph with the circumference at most 8 is supereulerian, which is then applied to show that a 3-connected claw-free graph without Z 8 as an induced subgraph is hamiltonian, where Z 8 denotes the graph derived from identifying one endvertex of P 9 (a path with 9 vertices) with one vertex of a… (More)

Keywords: Hamilton-connected index Iterated line graph Diameter Maximum degree Connectivity a b s t r a c t Let G be an undirected graph that is neither a path nor a cycle.like indices of graphs, ARS Combinatoria 15 (1983) 131–148] defined hc(G) to be the least integer m such that the iterated line graph L m (G) is Hamilton-connected. Let diam(G) be the… (More)

—In this paper, we focus on the asymptotic capacity and delay, and their tradeoffs in mobile ad hoc networks (MANETs). As we all know, some fixed rate communication models such as the protocol model and the physical model have been studied in the past. However, our work aims to investigate the impact of an adaptive rate communication model on capacity-delay… (More)

A classical result of Chvátal and Erd˝ os says that the graph G with connectivity κ(G) not less than its independent number α(G) (i.e. κ(G) ≥ α(G)) is hamiltonian. In this paper, we show that the graph G with κ(G) ≥ α(G) − 1 is either supereulerian, or the Petersen graph, or the graphs obtained from K 2,3 by adding at most one vertex in one edge of K 2,3… (More)

- Cheng Wang, Jieren Zhou, Tianci Liu, Lu Shao, Huiya Yan, Xiang-Yang Li +1 other
- ArXiv
- 2015

—In this paper, we study capacity scaling laws of the deterministic dissemination (DD) in random wireless networks under the generalized physical model (GphyM). This is truly not a new topic. Our motivation to readdress this issue is twofold: Firstly, we aim to propose a more general result to unify the network capacity for general homogeneous random models… (More)

—In this paper, we address the issue on measuring the transport difficulty of data dissemination in online social networks (OSNs). We define a new metric, called transport complexity, as one of the fundamental limits on the data dissemination in OSNs. It involves two key factors: data arrival process at users and transport distance of messages, which are… (More)

- ‹
- 1
- ›