نتایج جستجو برای: higher randić index

تعداد نتایج: 1310303  

Journal: :Discrete Applied Mathematics 2003

Journal: :Discrete Applied Mathematics 2013

Journal: :journal of physical & theoretical chemistry 2005
avat (arman) taherpour fatemeh shafiee

one of the useful indices in molecular topology is randić index. the alternative double bonds andconjugation in the polyene compounds are one of the main properties in these compounds. someof the molecular orbital and structural properties refer to this specialty, such as: molar absorptioncoefficient (εmax) , electrical conductivity and difference energy level of the homo and lumoorbitals, etc....

Journal: :Journal of Mathematical Chemistry 2006

Journal: :European Journal of Combinatorics 2011

Journal: :Mediterranean Journal of Mathematics 2023

Abstract In this paper, we give various lower and upper bounds for the energy of graphs in terms several topological indices graphs: first general multiplicative Zagreb index, Randić zeroth-order redefined indices, atom-bond connectivity index. Moreover, obtain new certain graph invariants as diameter, girth, algebraic radius.

2008
Dragan Stevanović

Using the AutoGraphiX 2 system, Aouchiche, Hansen and Zheng [2] proposed a conjecture that the difference and the ratio of the Randić index and the diameter of a graph are minimum for paths. We prove this conjecture for chemical graphs.

2014
R. GU F. HUANG Ivan Gutman X. Li

Let G be a simple graph with vertex set V (G) = {v1, v2, . . . , vn} and edge set E(G) = {e1, e2, . . . , em}. Similar to the Randić matrix, here we introduce the Randić incidence matrix of a graph G, denoted by IR(G), which is defined as the n × m matrix whose (i, j)-entry is (di) 1 2 if vi is incident to ej and 0 otherwise. Naturally, the Randić incidence energy IRE of G is the sum of the sin...

2012
Tomáš Madaras Martina Mockovčiaková Mariusz Meszka

In this note, we derive the lower bound on the sum for Wiener index of bipartite graph and its bipartite complement, as well as the lower and upper bounds on this sum for the Randić index and Zagreb indices. We also discuss the quality of these bounds.

2014
S Burcu Bozkurt Durmuş Bozkurt

We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices (n), the number of edges (m), maximum vertex degree (Δ1), minimum vertex degree (δ), first Zagreb index (M 1), and Randić index (R -1).

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید