✦ LIBER ✦

Walking the Edge

✍ Scribed by Kallysten

Tongue: English
Weight: 157 KB
Series: On the Edge 6
Category: Fiction

No coin nor oath required. For personal study only.

✦ Synopsis

Vampires don’t grow old; it doesn’t stop Leo from dreading his birthday and the disappointments it brings. But this year with two lovers in his life, the day might just take a better turn. Lisa knows him well enough to guess what he doesn’t even realize he needs, while Brett is ready to give, and ask for, the greatest gifts. All Leo needs to do is hang on and ride the wave when it comes.

📜 SIMILAR VOLUMES

Walking the Edge

✍ Sue Ward Drake 📂 Fiction 📅 2021 🏛 Sourcebooks Casablanca 🌐 en-US ⚖ 333 KB

"Ex-army ranger Mitch Guidry never should have let his brothers talk him into joining them in the Big Easy. Particularly when they have him going head-to-head with the very last thing he needs: a feisty redhead who has more opinions than even his hard-headed brothers. Loyal and overprotective to a f

Walking the Edge

✍ Kallysten 📂 Fiction 🌐 English ⚖ 25 KB

Erotica/Dark Fantasy. 12872 words long.

Walking the Edge

✍ Kallysten 📂 Fiction 🌐 English ⚖ 128 KB

Walking Death's Edge

✍ Shannon, L 📂 Fiction 🌐 English ⚖ 731 KB

Walks through every edge exactly twice

✍ R. Bruce Richter 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

## Abstract In this article, we develop a theory of walks traversing every edge exactly twice. Rosenstiehl and Read proved that if __G__ is a graph with no set of edges that is simultaneously a cycle and a cocycle, then __G__ is planar if and only if there is a closed walk __W__ in __G__ traversing

Random walks on edge transitive graphs

✍ JoséLuis Palacios; JoséMiguel Renom 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 337 KB

We find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending prior results and allowing the computation of sharp upper and lower bounds for the expected cover times of those graphs.