Results 41 to 50 of about 124 (74)
Indeks Padmakar-Ivan dan indeks Randic pada graf non-koprima dari grup bilangan bulat modulo
Majalah Ilmiah Matematika dan StatistikaGraph theory, introduced by the Swiss mathematician Leonhard Euler in 1736, has played a pivotal role in solving real-world problems since its inception, notably exemplified by Euler's solution to the Konigsberg Bridge problem. Its applications extend to
Lalu Hasan Ghoffari +2 more
doaj +1 more source
The minimum exponential atom-bond connectivity energy of trees
Special MatricesLet G=(V(G),E(G))G=\left(V\left(G),E\left(G)) be a graph of order nn. The exponential atom-bond connectivity matrix AeABC(G){A}_{{e}^{{\rm{ABC}}}}\left(G) of GG is an n×nn\times n matrix whose (i,j)\left(i,j)-entry is equal to ed(vi)+d(vj)−2d(vi)d(vj){e}^
Gao Wei
doaj +1 more source
A new method for computing the vertex PI index with applications to special classes of graphs
AKCE International Journal of Graphs and CombinatoricsThe Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju +2 more
doaj +1 more source
Irregularity of expansions and Pell graphs
, 2021 For a graph $G$ the imbalance of an edge $uv$ of $G$ is $|deg_G(u)-deg_G(v)|$. Irregularity of a graph $G$ is defined as the sum of imbalances over all edges of $G$. In this paper we consider expansions and Pell graphs. If $H$ is an expansion of $G$ with
Taranenko, Andrej
core
On the vv-degree based first Zagreb index of graphs
AKCE International Journal of Graphs and CombinatoricsA topological index is a graph invariant applicable in chemistry. The first Zagreb index is a topological index based on the vertex degrees of molecular graphs. For any graph G, the first Zagreb index [Formula: see text] is equal to the sum of squares of
L. Anusha +2 more
doaj +1 more source
New bounds on Zagreb connection indices for trees with fixed domination number
AKCE International Journal of Graphs and CombinatoricsA set D of vertices in a graph G is a dominating set of G if every vertex not in D is adjacent to a vertex in D. The domination number, [Formula: see text], is the minimum cardinality among all dominating sets of G.
H. Rahbani +2 more
doaj +1 more source
Wiener index of an ideal-based zero-divisor graph of commutative ring with unity
AKCE International Journal of Graphs and CombinatoricsThe Wiener index of a connected graph G is [Formula: see text]. In this paper, we obtain the Wiener index of H-generalized join of graphs [Formula: see text]. As a consequence, we obtain some earlier known results in [Alaeiyan et al. in Aust. J.
Balamoorthy S. +2 more
doaj +1 more source
New bounds for variable topological indices and applications [PDF]
One of the most important information related to molecular graphs is given by the determination (when possible) of upper and lower bounds for their corresponding topological indices. Such bounds allow to establish the approximate range of the topological
Granados, Ana +3 more
core +1 more source
On spectra of Hermitian Randic matrix of second kind
, 2023 We propose the Hermitian Randi\'c matrix $R^\omega(X)=(R^\omega_{ij})$, where $\omega=\frac{1+i \sqrt{3}}{2}$ and $R^\omega_{ij}={1}/{\sqrt{d_id_j}}$ if $v_iv_j$ is an unoriented edge, ${\omega}/{\sqrt{d_id_j}}$ if $v_i\rightarrow v_j$, ${\overline ...
Bharali, A +3 more
core
, 2023 Let $R$ be a commutative ring with unity. The essential ideal graph $\mathcal{E}_{R}$ of $R$, is a graph with a vertex set consisting of all nonzero proper ideals of \textit{R} and two vertices $I$ and $K$ are adjacent if and only if $I+ K$ is an ...
Banerjee, Subarsha +2 more
core