Andere Kunden interessierten sich auch für
![Non-Neighbor Topological Indices]( "Non-Neighbor Topological Indices")
Non-Neighbor Topological Indices27,99 €![Some Results on Fixed and Common Fixed Points]( "Some Results on Fixed and Common Fixed Points")
Some Results on Fixed and Common Fixed Points40,99 €![ON SOME QUEUING MODELS LINKED WITH A COMMON SERVER]( "ON SOME QUEUING MODELS LINKED WITH A COMMON SERVER")
ON SOME QUEUING MODELS LINKED WITH A COMMON SERVER27,99 €![Fixed Point and Common Fixed Point Results In Metric spaces]( "Fixed Point and Common Fixed Point Results In Metric spaces")
Fixed Point and Common Fixed Point Results In Metric spaces47,99 €![Some Common Fixed Point Theorems In Metric And Cone Metric Spaces]( "Some Common Fixed Point Theorems In Metric And Cone Metric Spaces")
Some Common Fixed Point Theorems In Metric And Cone Metric Spaces33,99 €![Existence of Common Fixed Points in Generalized Metric Spaces]( "Existence of Common Fixed Points in Generalized Metric Spaces")
Existence of Common Fixed Points in Generalized Metric Spaces33,99 €![Nearest Neighbor Search]( "Nearest Neighbor Search")
Nearest Neighbor Search20,99 €
Graph theory is one of the well-flourished branches of Mathematics. Among various branches of graph theory, graph polynomials are one of the well-studied concepts as they are used to unveil the structural properties of graphs. Roughly speaking, a graph polynomial is a polynomial assigned to a graph whose coefficients are the indicators of some graph-theoretic parameters. It can be defined as a function from the set of all finite graphs to the polynomial ring over the set of real numbers such that isomorphic graphs are assigned to the same polynomial. In the present work, emphasizing the structural similarity of pairs of nodes in a network system, a new graph polynomial is introduced named as `Common neighbor polynomial of graphs'.