In the past few decades, although people have conducted in-depth research on community detection in one-mode networks, bipartite networks has not been extensively researched. this paper, we propose an improved artificial bee colony algorithm named IABC-BN, which is used to detect communities two-mode graphs (i.e. graphs) with two kinds of vertices cluster community). Firstly, paper proposed a n...

let g be a simple connected graph and {v1, v2, …, vk} be the set of pendent (vertices ofdegree one) vertices of g. the reduced distance matrix of g is a square matrix whose (i,j)–entry is the topological distance between vi and vj of g. in this paper, we obtain the spectrumof the reduced distance matrix of thorn graph of g, a graph which obtained by attaching somenew vertices to pendent vertice...

the unitary cayley graph xn has vertex set zn = {0, 1,…, n-1} and vertices u and v areadjacent, if gcd(uv, n) = 1. in [a. ilić, the energy of unitary cayley graphs, linear algebraappl. 431 (2009) 1881–1889], the energy of unitary cayley graphs is computed. in this paperthe wiener and hyperwiener index of xn is computed.

Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent with u2 and v1 is adjacent with v2). In this paper, we first collect the earlier results about strong product and then we present applications of ...

We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

The total version of geometric–arithmetic index of graphs is introduced based on the endvertex degrees of edges of their total graphs. In this paper, beside of computing the total GA index for some graphs, its some properties especially lower and upper bounds are obtained.

 In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.

INTRODUCTION Phototherapy is the cornerstone of treatment of vitiligo. The 308-nm excimer lamp (EL) induces T cell apoptosis and the stimulation of melanocyte proliferation. Khellin is a furanochromone with a chemical structure close to psoralens. The objective of the study was to evaluate the safety and efficacy of 1-year treatment of recalcitrant vitiligo with a combination of 308-nm EL and k...

From the time immemorial coconut bunches were harvested at two monthly intervals. In general two such bunches are harvested at a given harvest. However on the average a coconut bunch matures more or less every month. If these could be harvested at monthly intervals without any adverse effect on the nuts there will be several benefits. These are availability of nuts over the months, savings on m...