Author Archives: pisrt

ODAM-Vol. 4 (2021), Issue 3, pp. 60 – 71 Open Access Full-Text PDF

Abstract:In this paper, we obtain the quantitative calculation formula of the degree-based topological indices of four standard product for the path and regular graphs, which unify to solve the question on product of these basic graphs without having to deal with it one by one separately. As applications, we give corresponding calculation formula of the general Randić index, the first general Zagreb index and the general sum-connectivity index.

ODAM-Vol. 4 (2021), Issue 3, pp. 36 – 59 Open Access Full-Text PDF

Abstract:The temporal dynamics of games have been studied widely in evolutionary spatial game theory using simulation. Each player is usually represented by a vertex of a graph and plays a particular game against every adjacent player independently. These games result in payoffs to the players which affect their relative fitness. The fitness of a player, in turn, affects its ability to reproduce. In this paper, we analyse the temporal dynamics of the evolutionary 2-person, 2-strategy snowdrift game in which players are arranged along a cycle of arbitrary length. In this game, each player has the option of adopting one of two strategies, namely cooperation or defection, during each game round. We compute the probability of retaining persistent cooperation over time from a random initial assignment of strategies to players. We also establish bounds on the probability that a small number of players of a particular mutant strategy introduced randomly into a cycle of players which have established the opposite strategy leads to the situation where all players eventually adopt the mutant strategy. We adopt an analytic approach throughout as opposed to a simulation approach clarifying the underlying dynamics intrinsic to the entire class of evolutionary spatial snowdrift games.

ODAM-Vol. 4 (2021), Issue 3, pp. 29 – 35 Open Access Full-Text PDF

Abstract:Let \(G\) be a simple graph with vertex set \(V=\{v_1,v_2,\ldots,v_n \}\), and let \(d_i\) be the degree of the vertex \(v_i\). The Sombor matrix of \(G\) is the square matrix \(\mathbf A_{SO}\) of order \(n\), whose \((i,j)\)-element is \(\sqrt{d_i^2+d_j^2}\) if \(v_i\) and \(v_j\) are adjacent, and zero otherwise. We study the characteristic polynomial, spectrum, and energy of \(\mathbf A_{SO}\). A few results for the coefficients of the characteristic polynomial, and bounds for the energy of \(\mathbf A_{SO}\) are established.

ODAM-Vol. 4 (2021), Issue 3, pp. 24 – 28 Open Access Full-Text PDF

Abstract:This note presents the characterization of the families of star, helm, flower and complete graphs by total vertex stress. The note does not present results for many families of graphs but, it highlights important philosophical (math. phil.) aspects for further research. In particular the novelty concepts of forgiven contradictions denoted by, iff\(_f\) as well as iffness and \(f\)-statements are introduced. The author suggests that the characterization of other families of graphs by total vertex stress is possible.