In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining ψk(G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of ψk(G) and pr...

A vertex dominating path in a graph is a path P such that every vertex outside P has a neighbor on P . In 1988 H. Broersma stated a result implying that every n-vertex kconnected graph G such that σ(k+2)(G) ≥ n− 2k − 1 contains a dominating path. We show that every n-vertex k-connected graph with σ2(G) ≥ 2n k+2 + f(k) contains a dominating path of length at most O(|T |), where T is a minimum do...

It is well known that every tournament has a directed path containing all the vertices of V , i.e. a hamiltonian path. It is an easy exercise to show that a tournament has a unique such path if and only if the arcs of A induce a transitive relation on V . In this paper we show that by reversing the arcs of the hamiltonian path in a transitive tournament with n vertices we obtain a tournament wi...

the eccentricity connectivity index of a molecular graph g is defined as (g) = av(g)deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to othervertices of g and deg(a) is degree of vertex a. here, we compute this topological index forsome infinite classes of dendrimer graphs.

Given a graph G, and two vertex sets S and T of size k each, a many-tomany k-disjoint path cover of G joining S and T is a collection of k disjoint paths between S and T that cover every vertex of G. It is classified as paired if each vertex of S must be joined to a designated vertex of T , or unpaired if there is no such constraint. In this article, we first present a necessary and sufficient ...

A subset S of vertices of a graph G = (V,E) is called a k-path vertex cover if every path on k vertices in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G and form a sequence ψ(G) = (ψ1(G), ψ2(G), . . . , ψ|V |(G)), called the path sequence of G. In this paper we prove necessary and sufficient conditions for two integers to appear on ...

For a graph G and a positive integer k, a subset S of vertices of G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. The cardinality of a minimum k-path vertex cover is denoted by ψk(G). In this paper, we present the exact values of ψk in some product graphs of stars and complete graphs.