Let G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if G has a distance-regular antipodal cover of diameter 4, then k ≤ 2(n + 1)/5 , unless G is the complement of triangular graph T (7), the folded Johnson graph J (8, 4) or the folded halved 8-cube. However, for these three graphs the bound k ≤ (n − 1)/2 holds. This result implies that only one of a complem...

In this paper, we propose a new static analysis method which is applicable for a classical linear logic programming language. Andreoli et al. proposed a static analysis method for the classical linear logic programming language LO, but their method did not cover multiplicative connectives which are important for a resource-sensitive feature of linear logic. Our method, in contrast, covers multi...

In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5. Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph. For each parameter set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic. In this way, we deal completely with 34 of these parameter se...

Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...

In this paper, we present the exact formulae for the multiplicative version of degree distance and the multiplicative version of Gutman index of strong product of graphs in terms of other graph invariants including the Wiener index and Zagreb index. Finally, we apply our results to the multiplicative version of degree distance and the multiplicative version of Gutman index of open and closed fe...

martindale proved that under some conditions every multiplicative isomorphism between two rings is additive. in this paper, we extend this theorem to a larger class of mappings and conclude that every multiplicative $(alpha, beta)-$derivation is additive.

For a (molecular) graph, the multiplicative Zagreb indices ∏ 1-index and ∏ 2index are multiplicative versions of the ordinary Zagreb indices (M1-index and M2index). In this note we report several sharp upper bounds for ∏ 1-index in terms of graph parameters including the order, size, radius, Wiener index and eccentric distance sum, and upper bounds for ∏ 2-index in terms of graph parameters inc...