DOIAbstract
In this paper we show that all cycles, wheels, trees and grids are strongly harmonic graphs. Also we give an upper bound and a lower bound for μ(n), the maximum number of edges in a strongly harmonic graph of order n
In this paper we show that all cycles, wheels, trees and grids are strongly harmonic graphs. Also we give an upper bound and a lower bound for μ(n), the maximum number of edges in a strongly harmonic graph of order n
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
Abstract: A graph G is said to be Smarandachely harmonic graph with property P if its vertices can b...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
AbstractThe ‘strength’ of an edge or cycle is the number of maximal complete subgraphs it is in. Str...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
AbstractThe harmonic index of a graph G is defined as the sum of the weights 2d(u)+d(v) of all edges...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal domi...
AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
Abstract: A graph G is said to be Smarandachely harmonic graph with property P if its vertices can b...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
AbstractThe ‘strength’ of an edge or cycle is the number of maximal complete subgraphs it is in. Str...
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicati...
AbstractThe harmonic index of a graph G is defined as the sum of the weights 2d(u)+d(v) of all edges...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal domi...
AbstractAn edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
An edge-magic total labeling on G is a one-to-one map λ from V(G)∪E(G) onto the integers 1,2,...,|V(...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
Add to ORKG