Related papers: Regular graphs to induce even periodic Grover walk…
An extension of an induced path $P$ in a graph $G$ is an induced path $P'$ such that deleting the endpoints of $P'$ results in $P$. An induced path in a graph is said to be avoidable if each of its extensions is contained in an induced…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In [Gutman, Cruz, Rada, Wiener index of Eulerian Graphs, Discrete…
This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…
We initiate the study of what we refer to as random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that the labeling occurs increasingly whenever an unlabeled vertex is…
The subclass of Euler graphs with only one type of cycles under (mod 4) operation was studied in Part-1 of this series. It was established that such graphs under regularity are nonexistent for degree >2. Here we consider the subclass of…
An odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We answer a question of Rosenfeld and Le by showing that odd wheels cannot be drawn in the plane such that the lengths of the edges are odd…
We call an oriented odd cycle alternating if it has exactly one vertex whose in-degree and out-degree are both positive. In this paper, we investigate whether certain graphs admit an orientation that avoids alternating odd cycles as…
An old problem of Erd\H{o}s, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem, we consider the order of such a subgraph in a typical…
As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least $2k+1$ admits a homomorphism to $PC_{2k}=(\mathbb{Z}_2^{2k}, \{e_1, e_2, ...,e_{2k}, J\})$ where $e_i$'s are standard basis and $J$ is…
A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equals the maximum clique number for every induced subgraph.…
Aldous [1] asked whether every graph in which the distribution of the return time of random is independent of the starting vertex must be transitive. We remark that this question can be reduced into a purely graph-theoretic one that had…
We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…
Evolution algebras are a new type of non-associative algebras which are inspired from biological phenomena. A special class of such algebras, called Markov evolution algebras, is strongly related to the theory of discrete time Markov…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
Coalescing-branching random walks, or {\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a $k$-cobra walk, at each…
We address the properties of continuous-time quantum walks with Hamiltonians of the form $\mathcal{H}= L + \lambda L^2$, being $L$ the Laplacian matrix of the underlying graph and being the perturbation $\lambda L^2$ motivated by its…