نتایج جستجو برای: join of graphs
تعداد نتایج: 21177796 فیلتر نتایج به سال:
In this work, we study the signed Roman domination number of the join of graphs. Specially, we determine it for the join of cycles, wheels, fans, and friendship graphs.
We propose new families of graphs which exhibit quantum perfect state transfer. Our constructions are based on the join operator on graphs, its circulant generalizations, and the Cartesian product of graphs. We build upon the results of Bašić and Petković (Applied Mathematics Letters 22(10):1609-1615, 2009) and construct new integral circulants and regular graphs with perfect state transfer. Mo...
In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...
The Narumi-Katayama index of a graph G is equal to the product of degrees of all the vertices of G. In this paper, we examine the NarumiKatayama index of some derived graphs such as a Mycielski graph, subdivision graphs, double graph, extended double cover graph, thorn graph, subdivision vertex join and edge join graphs.
let g be a simple connected graph. the first and second zagreb indices have been introducedas vv(g)(v)2 m1(g) degg and m2(g) uve(g)degg(u)degg(v) , respectively,where degg v(degg u) is the degree of vertex v (u) . in this paper, we define a newdistance-based named hyperzagreb as e uv e(g) .(v))2 hm(g) (degg(u) degg inthis paper, the hyperzagreb index of the cartesian product...
A new generalization of Fiedler's lemma is obtained by introducing the concept main function a matrix. As applications, universal spectra H-join any graphs (possibly non-regular) and adjacency H-generalized join constrained (arbitrary) vertex subsets are obtained. The generalized corona deduced from graphs. Also, construction infinitely many pairs non-regular cospectral provided.
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
Abstract In this paper, the exact formulae for the Harary indices of join, disjunction, symmetric difference, strong product of graphs are obtained. Also, the Schultz and modified Schultz indices of join and strong product of graphs are computed. We apply some of our results to compute the Harary, Schultz and modified Schultz indices of fan graph, wheel graph, open fence and closed fence graphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید