Strongly perfect graphs were introduced by C. Berge and P. Duchet in [1]. In [4], [3] the following was studied: the problem of strong perfectness for the Cartesian product, the tensor product, the symmetrical difference of n, n ≥ 2, graphs and for the generalized Cartesian product of graphs. Co-strong perfectness was first studied by G. Ravindra and D. Basavayya [5]. In this paper we discuss s...

This paper,  applies the concept  of KM-fuzzy metric spaces and  introduces a novel concept of KM-fuzzy metric  graphs based on KM-fuzzy metric spaces.  This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to  extend   the concept of KM-fuzzy metric spaces to  a larger ...

In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...

Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...

The generalized hierarchical product of graphs was introduced by L. Barriére et al in 2009. In this paper, reformulated first Zagreb index of generalized hierarchical product of two connected graphs and hence as a special case cluster product of graphs are obtained. Finally using the derived results the reformulated first Zagreb index of some chemically important graphs such as square comb latt...

In this report we obtain (good) upper bounds on the acyclic chromatic index of graphs obtained as the tensor product of two (or more) graphs, in terms of the acyclic chromatic indices of those factor graphs in the tensor product. Our results assume that optimal colourings for the factor graphs are given and our algorithms extend these colourings to obtain good (close to optimal) colourings of t...

............................................................................................................................................ 2 ACKNOWLEDGEMENTS ....................................................................................................................... 4 CONTENTS .............................................................................................................

Stochastic Kronecker Product Graphs are an interesting and useful class of Generative Network Models. They can be fitted using a fast Maximum Likelihood Estimator and reproduce many important statistical properties commonly found in large real-world networks. However, they suffer from an unfortunate drawback: the need to pad the Stochastic Kronecker Product Graph with isolated vertices. To addr...