the hosoya index and the merrifield-simmons index are two types of graph invariants used in mathematical chemistry. in this paper, we give some formulas for computed these indices for some classes of corona product and link of two graphs. furthermore, we obtain exact formulas of hosoya and merrifield-simmons indices for the set of bicyclic graphs, caterpillars and dual star.

in this work, using eigenvalues and eigenvectors of unitary cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing pst occurring in its unitary cayley graph. moreover, we have some developments when $r$ is a product of local rings.

November 2005 Vol.6 No.2 IEEE Intelligent Informatics Bulletin Abstract--Similarity measure is one of important, effective and widely-used methods in data processing and analysis. As vague set theory has become a promising representation of fuzzy concepts, in this paper we present a similarity measure approach for better understanding the relationship between two vague sets in applications. Com...

In this paper, we present two new methods for evaluating students’ answerscripts using vague values, where the evaluating marks awarded to the questions in the students’ answerscripts are represented by vague values. The vague mark awarded to each question of a student’s answerscript can be regarded as a vague set, where each element in the universe of discourse belonging to the vague set is re...

In this paper, we introduce the notion of Pythagorean Anti fuzzy graph. We then define Cartesian product and Lexicographic on It is proved that two graphs graph general, lexicographic regular need not be Necessary sufficient conditions for to are determined. Further, concept isomorphism with suitable example.

Abstract—In graph theory, different types of products of two graphs had been studied, e.g., Cartesian product, Tensor product, Strong product, etc. In this paper we generalize the concept of Cartesian product of graphs.We define 2 Cartesian product and more generally r Cartesian product of two graphs. We study these product mainly for path graphs. We also discuss connectedness of the new graph.