Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2018
…
11 pages
1 file
Let $G=(V,E)$ be a graph. The injective neighborhood of a vertex $u\in V(G)$ denoted by $N_{in}(u)$ is defined as $N_{in}(u)=\{v\in V(G):|\Gamma(u,v)|\geq 1\}$, where $|\Gamma(u,v)|$ is the number of common neighborhoods between the vertices $u$ and $v$ in $G$. The cardinality of $N_{in}(u)$ is called the injective degree of the vertex $u$ in $G$ and denoted by $deg_{in}(u)$, \cite{20}. In this paper, we introduce the injective Zagreb indices of a graph $G$ as $M_1^{inj}(G)=\sum_{u\in V(G)}\big[deg_{in}(u)\big]^2$, $M_2^{inj}(G)=\sum_{uv\in E(G)}deg_{in}(u)deg_{in}(v)$, respectively, and the relative injective Zagreb indices as $RM_1^{inj}(G)=\sum_{u\in V(G)}deg_{in}(u)deg(u)$, $RM_2^{inj}(G)=\sum_{uv\in E(G)}\big[deg_{in}(u)deg(v)+deg(u)deg_{in}(v)\big]$, respectively. Some properties of these topological indices are obtained. Exact values for some families of graphs and some graph operations are computed.
Hacettepe Journal of Mathematics and Statistics, 2012
For a (molecular) graph, the first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. It is well-known that for connected or disconnected graphs, M2/m ≥ M1/n does not hold always. In K. C. Das (On comparing Zagreb indices of graphs, MATCH Commun. Math. Comput. Chem. 63, 433–440, 2010), it has been shown that the above relation holds for a special kind of graph. Here we continue our search for special kinds of graph for which the above relation holds.
Mathematics
A topological index is a numeric quantity that is closely related to the chemical constitution to establish the correlation of its chemical structure with chemical reactivity or physical properties. Miličević reformulated the original Zagreb indices in 2004, replacing vertex degrees by edge degrees. In this paper, we established the expressions for the reformulated Zagreb indices of some derived graphs such as a complement, line graph, subdivision graph, edge-semitotal graph, vertex-semitotal graph, total graph, and paraline graph of a graph.
Journal of Mathematics
Topological indices are graph-theoretic parameters which are widely used in the subject of chemistry and computer science to predict the various chemical and structural properties of the graphs respectively. Let G be a graph; then, by performing subdivision-related operations S , Q , R , and T on G , the four new graphs S G (subdivision graph), Q G (edge-semitotal), R G (vertex-semitotal), and T G (total graph) are obtained, respectively. Furthermore, for two simple connected graphs G and H , we define F -sum graphs (denoted by G + F H ) which are obtained by Cartesian product of F G and H , where F ∈ S , R , Q , T . In this study, we determine first general Zagreb co-index of graphs under operations in the form of Zagreb indices and co-indices of their basic graphs.
, where d G (v) is the degree of the vertex v. In this paper we compute these indices for link and splice of graphs. In continuation, with use these graph operations, we compute the first and the second multiplicative Zagreb indices for a class of dendrimers.
2020
Let G = (V, E) be a graph. The first Zagreb index and second Zagreb index of G are defined as v∈V d 2 (v) and uv∈E d(u)d(v), respectively. Using first and second Zagreb indices of graphs, we in this note present sufficient conditions for some Hamiltonian properties of graphs.
Analele Universitatii "Ovidius" Constanta - Seria Matematica, 2016
For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as
2012
In this study, we first find formulae for the first and second Zagreb indices and coindices of certain classical graph types including path, cycle, star and complete graphs. Secondly we give similar formulae for the first and second Zagreb coindices.
Proyecciones (Antofagasta), 2020
Hacettepe Journal of Mathematics and Statistics, 2019
Recently, Furtula et al. [B. Furtula, I. Gutman, S. Ediz, On difference of Zagreb indices, Discrete Appl. Math., 2014] introduced a new vertex-degree-based graph invariant "reduced second Zagreb index" in chemical graph theory. Here we generalize the reduced second Zagreb index (call "general reduced second Zagreb index"), denoted by GRM α (G) and is defined as: , where α is any real number and d G (v) is the degree of the vertex v of G. Let G k n be the set of connected graphs of order n with k cut edges. In this paper, we study some properties of GRM α (G) for connected graphs G. Moreover, we obtain the sharp upper bounds on GRM α (G) in G k n for α ≥ -1/2 and characterize the extremal graphs.
In this paper, we introduce Zagreb Indices of Some New Graphs. Exactly, first index, second index and forgotten index. New graphs are generated from the initial graphs by graph operations. We also created some possible applications on the Zagreb indices as special cases.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Discrete Applied Mathematics, 2010
Opuscula Mathematica, 2016
International Journal of Analysis and Applications, 2022
Proceedings of the National Academy of Sciences, India Section A: Physical Sciences, 2020
Journal of Inequalities and Applications, 2013
Revue Roumaine De Chimie, 2021
DOAJ (DOAJ: Directory of Open Access Journals), 2019
Miskolc Mathematical Notes, 2010
International Journal of Apllied Mathematics, 2020
Journal of Ultra Scientist of Physical Sciences Section A, 2020
Advances in Mathematics: Scientific Journal
Discrete Applied Mathematics, 2010
MATCH Communications in Mathematical and in Computer Chemistry
Discrete Mathematics, Algorithms and Applications, 2017
Asian Research Journal of Mathematics, 2020