Related papers: Degree sequence of the generalized Sierpinski grap…
Let $G=(V,E)$ be a simple graph with $n = |V|$ vertices and $m = |E|$ edges. The first and second Zagreb indices are among the oldest and the most famous topological indices, defined as $M_1 = \sum_{i \in V} d_i^2$ and $M_2 = \sum_{(i, j)…
This paper completes the project started in [10]; to solve the edge-isoperimetric problem on the (generalized and extended) Sierpinski graph, S(n,m). We prove that initial segments of lexicographic order are solutions of the EIP for all…
The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total…
A simple connected graph G is called a p-quasi k-cyclic graph, if there exists a subset S of vertices such that |S|=p, G-S is k-cyclic and there is no a subset S` of V(G) such that |S`|<|S| and G-S` is k-cyclic. The aim of this paper is to…
Generalised degrees provide a natural bridge between local and global topological properties of networks. We define the generalised degree to be the number of neighbours of a node within one and two steps respectively. Tailored random graph…
In this paper, we introduce the concept of curling subsequence of simple, finite and connected graphs. A curling subsequence is a maximal subsequence $C$ of the degree sequence of a simple connected graph $G$ for which the curling number…
Continuing the recent work of L. Zhong and K. Xu [MATCH Commun. Math. Comput. Chem.71(2014) 627-642], we determine inequalities among several vertex-degree-based topological indices; first geometric-arithmetic index(GA), augmented Zagreb…
We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of…
In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…
In this paper, the investigates Adriatic indices, specifically the sum lordeg index where it defined as $SL(G) = \sum_{u \in V(G)} \deg_G(u) \sqrt{\ln \deg_G(u)}$ and the variable sum exdeg index $SEI_a(G)$ for $a>0$, $a\neq 1$. We present…
The authors Mili$\breve{c}$evi$\acute{c}$ et al. introduced the reformulated Zagreb indices, which is a generalization of classical Zagreb indices of chemical graph theory. In the paper, we characterize the extremal properties of the first…
We examine the chromatic index of generalized truncations of graphs and multigraphs.
In this paper we compute first and second Zagreb indices of commuting and non-commuting graphs of finite groups and determine several classes of finite groups such that their commuting and non-commuting graphs satisfy Hansen-Vuki\v{c}evi\'c…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
For a finite sequence of positive integers to be the degree sequence of a finite graph, Zverovich and Zverovich gave a sufficient condition involving only the length of the sequence, its maximal element and its minimal element. In this…
We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the $N$-type case, we define the (generalized) degree of a given…
The median $M$ of a graph $G$ is the set of vertices with a minimum total distance to all other vertices in the graph. In this paper, we determine the median of Sierpi\'{n}ski triangle graphs. Sierpi\'{n}ski triangle graphs, also known as…
We introduce a notion of generalized homogeneous derivations on graded rings as a natural extension of the homogeneous derivations defined by Kanunnikov. We then define gr-generalized derivations, which preserve the degrees of homogeneous…
The wreath product of graphs is a graph composition inspired by the notion of wreath product of groups, with interesting connections with Geometric Group Theory and Probability. This paper is devoted to the description of some degree and…
In this paper we study identifying codes, locating-dominating codes, and total-dominating codes in Sierpinski graphs. We compute the minimum size of such codes in Sierpinski graphs.