Results 151 to 160 of about 564,780 (171)

Chromatic Zagreb and irregularity polynomials of graphs

Discrete Mathematics, Algorithms and Applications, 2020
Graph coloring is an assignment of colors, labels or weights to elements of a graph subject to certain constraints. Coloring the vertices of a graph in such a way that adjacent vertices are having different colors is called proper vertex coloring. A proper vertex coloring using minimum parameters of colors is studied extensively in recent literature ...
Smitha Rose, Sudev Naduvath
openaire   +2 more sources

ZAGREB POLYNOMIALS AND MULTIPLE ZAGREB INDICES FOR COMB GRAPH

JP Journal of Algebra, Number Theory and Applications, 2018
Summary: A topological index of graph \(G\) is a numerical parameter related to \(G\), which characterizes its topology and is preserved under isomorphism of graphs. Properties of the chemical compounds and topological indices are correlated. In this report, we compute closed forms of first Zagreb, second Zagreb, first multiple Zagreb index and second ...
Kang, Shin Min, Rauf, Abdul, Khalid, Waseem, Nazeer, Waqas   +3 more
openaire   +1 more source

The first and second Zagreb polynomial and the forgotten polynomial of Cm×Cn

2020
In this paper, the 1st and 2nd Zagreb polynomials and the forgotten polynomial of Cm×Cn were computed. Some degree-based topological indices such as 1st and 2nd multiple Zagreb indices, Hyper Zagreb index and the forgotten index or F-index of the given networks were also computed. In addition, we represented the outcome by graphical representation that
CANCAN, MURAT, Afzal, Deeba, BAIG, AQ, Afzal, Farkhanda, EDİZ, SÜLEYMAN, FARAHANI, MR   +5 more
openaire   +3 more sources

On degree based topological invariants and Zagreb polynomials of graph constructions

AIP Conference Proceedings, 2020
In this article, the exact formulae for first and second Zagreb index, F-index, Hyper-Zagreb index, Symmetric Division Degree index, reformulated F-index of three graph constructions such as k—Fold graphs, k—Splitting graphs, k—Shadow graphs of a graph are obtained.
G Mohanappriya, D. Vijayalakshmi
openaire   +1 more source

General Fifth M-Zagreb Indices and Fifth M-Zagreb Polynomials of PAMAM Dendrimers

International Journal of Fuzzy Mathematical Archive, 2017
A molecular graph or a chemical graph is a simple graph related to the structure of a chemical compound. In this paper, we introduce the general fifth M-Zagreb indices and fifth M3-Zagreb index and their polynomials of a molecular graph. Also we compute the general fifth M-Zagreb indices and fifth M3-Zagreb index of PAMAM dendrimer graphs.
openaire   +1 more source

Computing the First and Third Zagreb Polynomials of Cartesian Product of Graphs

2011
Let G be a graph. The first Zagreb polynomial M1(G, x) and the third Zagreb polynomial M3(G, x) of the graph G are defined as:     ( ) ( , ) [ ] e uv E G G x x d(u) + d(v) M1 , ( , )  euvE(G) G x x|d(u) - d(v)| M3 . In this paper, we compute the first and third Zagreb polynomials of Cartesian product of two graphs and a type of dendrimers.
ASTANEH-ASL, A., FATH-TABAR, GH.
openaire   +1 more source

Algebraic method for characteristic Edge-Zagreb and Laplacian polynomials of graphs

2020
Summary: Polynomials corresponding to graphs and their roots have many applications including the energy defined algebraically by means of the adjacency matrix which is defined as a \(0-1\) matrix according to the neighbouring relations of vertices.
CANGÜL, İSMAİL NACİ, ÖZ, MERT SİNAN   +1 more
openaire   +2 more sources

M-Polynomials and Zagreb Indices for i-Iterated Subdivided-Line Graphs

Match Communications in Mathematical and in Computer Chemistry
The i-iterated subdivided-line graph Γi(G) of a base graph G is the graph obtained from G by iteratively applying the subdividedline graph operation i times. The M-polynomial of a graph G is a bivariate polynomial that encodes the degree-based properties of G.
Vitor S. Ponciano, Diego Pacheco, Simone Dantas, Alessandra B. Verissimo   +3 more
openaire   +1 more source

Harmonic and Zagreb Polynomials and Their Applications on Chemical Nano-Structures

Advances in Nonlinear Variational Inequalities
The graph ???? consists of an ordered pair (????, ????), where ???? represents a nonempty set of elements called vertices for graph ????, and ???? is a family of unordered pairs that may be free of vertices in graph ???? and is called edges for graph ????.
openaire   +1 more source

On Domination Zagreb Polynomials of Graphs and Some Graph Operations

International Journal of Mathematics Trends and Technology, 2022
Ashwini A. S, Hanan Ahmed, Soner Nandappa D   +2 more
openaire   +1 more source