Add to ORKGThe beta-number of a graph G is the smallest positive integer n for which there exists an injective function f : V(G)→{0,1,...,n} such that each uv ∈ E(G) is labeled f(u)－ｆ(v) and the resulting set of edge labels is ｛c,c＋1,...,c＋E(G) －1} for some positive integer c. The beta-number of G is ＋∞ if there exists no such integer n. If c=1, then the resulting beta-number is called the strong beta-number of G. ln this paper, we determine formulas for the (strong) beta-numbers of the coronas of certain graphs with the empty graph of order n
Numbers of the form On = n (3n-2) for all n≥1 are called octagonal numbers. Let G be a graph with p ...
AbstractGiven a graph G=(V,E) and a positive integer d, an L(d,1)-labelling of G is a function f:V→{...
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
The beta-number of a graph G is the smallest positive integer n for which there exists an injective ...
The beta-number, ß (G), of a graph G is defined to be either the smallest positive integer n for whi...
The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for whi...
The basis number b(G) of a graphG is defined to be the least integer k such thatG has a k-fold basis...
The basis number b(G) of a graph G is defined to be the least integer k such that G has a k-fold bas...
Let N0 be the set of all non-negative integers and P(N0) be its the power set. An integer additive s...
∗ Corresponding author. Let N0 be the set of all non-negative integers and P(N0) be its the power se...
Abstract. A set of vertices S of a graph G is a geodetic set of G if every vertex v < S lies on a...
Let N0 be the set of all non-negative integers, let X ⊂ N0 andP(X) be the the power set of X. An int...
AbstractWe introduce a new invariant, the coronal of a graph, and use it to compute the spectrum of ...
International audienceA signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G...
AbstractAs an edge variant of the well-known irregularity strength of a graph G=(V,E) we investigate...
Numbers of the form On = n (3n-2) for all n≥1 are called octagonal numbers. Let G be a graph with p ...
AbstractGiven a graph G=(V,E) and a positive integer d, an L(d,1)-labelling of G is a function f:V→{...
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
The beta-number of a graph G is the smallest positive integer n for which there exists an injective ...
The beta-number, ß (G), of a graph G is defined to be either the smallest positive integer n for whi...
The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for whi...
The basis number b(G) of a graphG is defined to be the least integer k such thatG has a k-fold basis...
The basis number b(G) of a graph G is defined to be the least integer k such that G has a k-fold bas...
Let N0 be the set of all non-negative integers and P(N0) be its the power set. An integer additive s...
∗ Corresponding author. Let N0 be the set of all non-negative integers and P(N0) be its the power se...
Abstract. A set of vertices S of a graph G is a geodetic set of G if every vertex v < S lies on a...
Let N0 be the set of all non-negative integers, let X ⊂ N0 andP(X) be the the power set of X. An int...
AbstractWe introduce a new invariant, the coronal of a graph, and use it to compute the spectrum of ...
International audienceA signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G...
AbstractAs an edge variant of the well-known irregularity strength of a graph G=(V,E) we investigate...
Numbers of the form On = n (3n-2) for all n≥1 are called octagonal numbers. Let G be a graph with p ...
AbstractGiven a graph G=(V,E) and a positive integer d, an L(d,1)-labelling of G is a function f:V→{...
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...