Related papers: Number of walks and degree powers in a graph

Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…

We address problem of determining edge weights on a graph using non-backtracking closed walks from a vertex. We show that the weights of all of the edges can be determined from any starting vertex exactly when the graph has minimum degree…

The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…

A $k$-ranking of a graph $G$ is a labeling of its vertices from $\{1,\ldots,k\}$ such that any nontrivial path whose endpoints have the same label contains a larger label. The least $k$ for which $G$ has a $k$-ranking is the ranking number…

We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…

In this work, we delve into the study of the 2-switch-degree of a graph $G$, which is nothing more than the degree of $G$ as a vertex of the realization graph $\mathcal{G}(d)$ associated with the degree sequence $d$ of $G$. We explore the…

The $k$-independence number of a graph $G$ is the maximum size of a set of vertices at pairwise distance greater than $k$. In this paper, for each positive integer $k$, we prove sharp upper bounds for the $k$-independence number in an…

The power graph of a given finite group is a simple undirected graph whose vertex set is the group itself, and there is an edge between any two distinct vertices if one is a power of the other. In this paper, we find a precise formula to…

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…

A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to something in the set. The domination sequence of the graph is the sequence whose $k$th term is the number…

In this paper, we propose and investigate the concept of $k$-coalitions in graphs, where $k\ge 1$ is an integer. A $k$-coalition refers to a pair of disjoint vertex sets that jointly constitute a $k$-dominating set of the graph, meaning…

A vertex of degree one is called an end-vertex, and an end-vertex of a tree is called a leaf. A tree with at most $k$ leaves is called a $k$-ended tree. For a positive integer $k$, let $t_k$ be the order of a largest $k$-ended tree. Let…

This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

For $k\ge 1$, the $k$-independence number $\alpha_k$ of a graph is the maximum number of vertices that are mutually at distance greater than $k$. The well-known inertia and ratio bounds for the (1-)independence number $\alpha(=\alpha_1)$ of…

Graph burning is a discrete-time process that models the spread of social contagion. Initially, all vertices are unburned. In each round, one unburned vertex is selected and burned, while any unburned vertex that has a burned neighbour from…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

For a graph $G$, its $k$-th power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$ of each other. The $k$-independence number $\alpha_k(G)$ is defined as the independence number of $G^k$. By using…

For a graph $G$ whose degree sequence is $d_{1},..., d_{n}$, and for a positive integer $p$, let $e_{p}(G)=\sum_{i=1}^{n}d_{i}^{p}$. For a fixed graph $H$, let $t_{p}(n,H)$ denote the maximum value of $e_{p}(G)$ taken over all graphs with…

We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of…