Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Total-Neighbor-Distinguishing Coloring by Sums of the Three Types of Product Graphs
We consider a proper total coloring \( \sigma \) of edges and vertices in a simple graph
-
Article
Extremal problem with respect to Merrifield-Simmons index and Hosoya index of a class of polygonal chains
The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this...