Erotica/Dark Fantasy. 12872 words long.
Walking the Edge
β Scribed by Sue Ward Drake
- Publisher
- Sourcebooks Casablanca
- Year
- 2021
- Tongue
- en-US
- Weight
- 333 KB
- Category
- Fiction
- City
- Louisiana--New Orleans., New Orleans (La.
- ISBN
- 1492697524
No coin nor oath required. For personal study only.
β¦ Synopsis
"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 fault, Catherine Hurley will do everything she can to stop Mitch from finding her fugitive brother... and yet, he can't get enough of her. Cath should be furious with the overbearing ex-ranger who shows up on her doorstep looking for her brother. Sure, Mitch Guidry is hotter than a Louisiana summer and pushes every one of her buttons, but he's also an immediate threat to her family, and family is everything to Cath. Unfortunately, the only way to save her brother is to stick to Mitch like glue. But sharing close quarters with him while they search for her missing brother together proves to be more than a little challenging... particularly when it comes to protecting her heart."--Provided by publisher.
β¦ Subjects
Louisiana -- New Orleans
π SIMILAR VOLUMES
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 as
## 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
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.