Search

The energy of a graph G, denoted by E(G), is defined as the sum of absolute values of all eigenvalues of G. A graph G is called reciprocal if 1/≥ is an eigenvalue of G whenever λ is an eigenvalue of G. Further, if λ and 1 λ have the same multiplicities, for each eigenvalue λ, then it is called strong reciprocal. In (MATCH Commun. Math. Comput. Chem. 83 (2020) 631{633), it was conjectured that for every graph G with maximum degree Δ(G) and minimum degree ∞(G) whose adjacency matrix is non-singular, E(G) λ Δ(G) + ∞(G) and the equality holds if and only if G is a complete graph. Here, we prove the validity of this conjecture for some strong reciprocal graphs. Moreover, we show that if G is a strong reciprocal graph, then E(G) λ Δ(G) + ∞(G) - 1 2. Recently, it has been proved that if G is a reciprocal graph of order n and its spectral radius, ?, is at least 4λmin, where λmin is the smallest absolute value of eigenvalues of G, then E(G) λ n + 1 2. In this paper, we extend this result to almost all strong reciprocal graphs without the mentioned assumption. [ABSTRACT FROM AUTHOR]

Inequalities are frequently used in various fields of mathematics to prove theorems. The existence of inequalities contributes significantly to the foundations of such branches. In this paper, we study the properties of order relations in the system of dual numbers, which is inspired by order relations defined on real numbers. Besides, some special inequalities that are used in various fields of mathematics, such as Cauchy-Schwarz, Minkowski, and Chebyshev are studied in this framework. An example is also provided to validate our research findings. [ABSTRACT FROM AUTHOR]

The paper deals with hypergroupoids obtained from ternary relations.The correspondence between ternary relation and hypergroups, studied by the author, especially in the case when the relation ρ is symmetric and reflexive, is analyzed here in the most general context.A necessary and sufficient condition on a ternary relation ρ is obtained for the associated hypergroupoid to be a hypergroup or a join space. Extension of a hyperoperation associated with a ternary relation being employed to obtain a associated join space of the spherical geometry. [ABSTRACT FROM AUTHOR]