✦ LIBER ✦

On the number of distinct orderings of a vertex-labeled graph when rooted on different vertices

✍ Scribed by M Gordon; T.G Parker; W.B Temple

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 765 KB
Volume: 11
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90025-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On labeled vertex-transitive digraphs wi

On labeled vertex-transitive digraphs with a prime number of vertices

✍ Chong-Yun Chao; Jacqueline G. Wells 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 481 KB

## We enumerate, up to isomorphism, several classes of labeled vertex-transitive digraphs with a prime number of vertices. There are many unsolvedi enumeration problems stated in [S]. Recently, Robinson in [8] posed more enumeration problems. Here, we give some partial answer to the problems posed

On the number of distinct induced subgra

On the number of distinct induced subgraphs of a graph

✍ P. Erdős; A. Hajnal 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 582 KB

On the number of vertices of given degre

On the number of vertices of given degree in a random graph

✍ Zbigniew Palka 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

The asymptotic number of rooted maps on

The asymptotic number of rooted maps on a surface.: II. Enumeration by vertices and faces

✍ Edward A Bender; E.Rodney Canfield; L.Bruce Richmond 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 436 KB

On seasonal error correction when the pr

On seasonal error correction when the processes include different numbers of unit roots

✍ Johan Lyhagen; Mårten Löf 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

## Abstract We propose a seasonal cointegration model (SECM) for quarterly data which includes variables with different numbers of unit roots and thus needs to be transformed in different ways in order to yield stationarity. A Monte Carlo simulation is carried out to investigate the consequences of

A remark on the number of vertices of de

A remark on the number of vertices of degree k in a minimally k-edge-connected graph

✍ Mao-cheng Cai 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Let G be a minimally k-edge-connected simple graph and u\*(G) be the number of vertices of degree k in G. proved that (i) uk(G) 2 l(jGl -1)/(2k + l)] + k + 1 for even k, and (ii) uI(G) 2 [lGl/(k + l)] + k for odd k 35 and u,(G) 2 lZlGl/(k + l)] + k -2 for odd k 27, where ICI denotes the number of v