Let G be a graph. For two vertices u and v in G, we denote d(u, v) the distance between u and v. Let j, k be positive integers with j > k. An L(j, k)labelling for G is a function f : V (G) → {0, 1, 2, · · ·} such that for any two vertices u and v, |f(u) − f(v)| is at least j if d(u, v) = 1; and is at least k if d(u, v) = 2. The span of f is the difference between the largest and the smallest nu...

This paper provides new upper bounds on the spectral radius ρ (largest eigenvalue of the adjacency matrix) of graphs embeddable on a given compact surface. Our method is to bound the maximum rowsum in a polynomial of the adjacency matrix, using simple consequences of Euler’s formula. Let γ denote the Euler genus (the number of crosscaps plus twice the number of handles) of a fixed surface Σ. Th...

The spectral radius (or the signless Laplacian radius) of a general hypergraph is maximum modulus eigenvalues its adjacency Laplacian) tensor. In this paper, we firstly obtain lower bound hypergraphs in terms clique number. Moreover, present relation between homogeneous polynomial and number hypergraphs. As an application, finally upper

doctors and clients sometimes experience interactive clashes during hospital meetings in south-western nigerian hospitals because of their divergent culture-constrained orientation to politeness cues. the goal of this paper is to unpack the discursive elements that characterize interactive confluence and divergence in selected consultative encounters in the hospitals. the findings indicate that...