✦ LIBER ✦

The connected hub number and the connected domination number

✍ Scribed by Peter Johnson; Peter Slater; Matt Walsh

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 189 KB
Volume: 58
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20433

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rainbow connection number and connected

Rainbow connection number and connected dominating sets

✍ L. Sunil Chandran; Anita Das; Deepak Rajendraprasad; Nithin M. Varma 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

## Abstract The __rainbow connection number__ of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on __

The number of connected sparsely edged g

The number of connected sparsely edged graphs

✍ E. M. Wright 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^n−2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp

Putting numbers on the network connectio

Putting numbers on the network connections

✍ Gary D. Stormo; Yue Zhao 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 1 views

## Abstract DNA–protein interactions are fundamental to many biological processes, including the regulation of gene expression. Determining the binding affinities of transcription factors (TFs) to different DNA sequences allows the quantitative modeling of transcriptional regulatory networks and ha

The number of maximal independent sets i

The number of maximal independent sets in connected graphs

✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,

The Number of Removable Edges in 3-Conne

The Number of Removable Edges in 3-Connected Graphs

✍ Su Jianji 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

An edge of a 3-connected graph G is said to be removable if G&e is a subdivision of a 3-connected graph. Holton et al. (1990) proved that every 3-connected graph of order at least five has at least W(|G| +10)Â6X removable edges. In this paper, we prove that every 3-connected graph of order at least

Independence number, connectivity, and r

Independence number, connectivity, and r-factors

✍ Tsuyoshi Nishimura 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 270 KB

We show that if r L 1 is an odd integer and G is a graph with IV(G)l even such that K ( G ) 2 ( r + 1)2/2 and (r + l)'a(G) 5 4 r ~( G ) , then G has an rfactor; if r 2 2 is even and G is a graph with K ( G ) L r(r + 2)/2 and then G has an r-factor (where K(G) and a ( G ) denote the connectivity and