2 citations · 2 across the 4 of their papers we have counts for
7 papers
Graph Irregularity Characterization with Particular Regard to Bidegreed Graphs
Ali Ghalavand, Tamás Réti, Igor Z. Milovanović +1
In this study we are interested mainly in investigating the relations between two graph irregularity measures which are widely used for structural irregularity characterization of…
On the Number of Matchings in Graphs
Kinkar Ch. Das, Ali Ghalavand, Ali Reza Ashrafi
Suppose is a undirected simple graph. A subset of edges in without common vertices is called a matching and the number of such subsets is denoted by . The a…
Laplacian Coefficients of a Forest in terms of the Number of Closed Walks in the Forest and its Line Graph
Ali Ghalavand, Ali Reza Ashrafi
Let be a finite simple graph with Laplacian polynomial . In an earlier paper, the coefficients and for tree with respec…
On a Conjecture About the Sombor Index of Graphs
Kinkar Chandra Das, Ali Ghalavand, Ali Reza Ashrafi
Let be a graph with vertex set and edge set . The Sombor and reduced Sombor indices of are defined as and…
On a Conjecture about Degree Deviation Measure of Graphs
Ali Ghalavand, Ali Reza Ashrafi
Let G be an n-vertex graph with m edges. The degree deviation measure of G is defined as s(G)=sum v in V(G)|degG(v)-(2m/n)|, where n and m are the number of vertices and edges of G…
Maximum Zagreb Indices Among All p-Quasi k-Cyclic Graphs
A Ghalavand, A R Ashrafi
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…