The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Let G=(V, E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges. We defined dv denote the degree of vertex v∈V(G). The Eccentric Connectivity index ξ(G) and the Connective Eccentric index Cξ(G) of graph G are defined as ξ(G)= [wzór] and Cξ(G)=[wzór] where ε(v) is defined as the length of a maximal path connecting a vertex v to another vertex of G. In this present paper,...
Let G be a molecular graph, a topological index is a numeric quantity related to G which is invariant under graph automorphisms. The eccentric connectivity index ξ(G) is defined as [wzór] where [wzór] denote the degree of vertex v in G and the largest distance between v and any other vertex u of G. The connective eccentric index of graph G is defined as [wzór] In the present paper we compute the connective...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.