• No results found

Central Graph

New Results on Labelings of Central Graph of Barbell Graph

New Results on Labelings of Central Graph of Barbell Graph

... obtained by subdividing each edge of B(p, n) exactly once and joining all the non adjacent vertices of B(p, n). In this paper, the ways to construct root mean square, square sum, square difference, cordial, total cordial ...

9

Equitable Power Domination Number of The Central Graph of Certain Graphs

Equitable Power Domination Number of The Central Graph of Certain Graphs

... Let × be a ladder with ( × ) = { , , … , , , , … , } and ( × ) = { , , … , }. Obtain the central graph of a ladder graph × with vertex set ( ( × )) = ∪ , where = ( × ) and = { , , … , }, the set of ...

8

Equitable Power Domination Number of The Central Graph of Certain Graphs

Equitable Power Domination Number of The Central Graph of Certain Graphs

... a graph ( , ) with vertex set , a set ⊆ is said to be a power dominating set (PDS), if every vertex ∈ − is observed by some vertices in using the following rules: (i) if a vertex in is in PDS, then it dominates ...

8

Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths

Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths

... Vernold Vivin, “On equitable coloring of central graphs and total graphs,” in International Conference on Graph Theory and Its Applications, vol.. 33 of Electronic Notes in Discrete Math[r] ...

6

Vol 7, No 8 (2016)

Vol 7, No 8 (2016)

... a graph is the least number of colours in such a ...of central graph of flower graph, belt graph, rose graph and steering graph and harmonious chromatic number for these ...

9

Equitable Coloring Of Prism Graph And Its Central,Middle, Total And Line Graph

Equitable Coloring Of Prism Graph And Its Central,Middle, Total And Line Graph

... Prism Graph (𝜒 (𝑌 )), the central graph of prism graph 𝜒 (C(𝑌 )) the middle graph of the prism graph 𝜒 (M(𝑌 )), the total graph of the prism graph 𝜒 (T(𝑌 ) and the ...

5

Case Study on Graph Processing Using Graph Engine

Case Study on Graph Processing Using Graph Engine

... Microsoft’s Graph Engine is a very vast topic to research on and we as a group have made is effort to cover as many modules as possible. We have listed advantages and disadvantages of the same and have developed a ...

5

document summarization using central sentences and keywords unpublished

document summarization using central sentences and keywords unpublished

... somehow central in the docu- ment. We represent the document as a graph, with sentences as vertices and edges labeled with sentence ...use graph-theoretical notions of vertex centrality ...identify ...

8

Some examples related to Conway Groupoids and their generalisations

Some examples related to Conway Groupoids and their generalisations

... the graph and the stabilizer of an edge has a center of order two, the central involution interchanging the two ends of the edge (and is typically of the form 2 × H where H is an almost simple ...

11

Survey on Large Graph Analysis and Visualization

Survey on Large Graph Analysis and Visualization

... large graph. GMine introduceses the concept of super graph ,Graph tree and CEPS ...sub graph ,it contains collection of paths connecting sub graph of ...query graph nodes and ...

5

Some examples related to Conway Groupoids

Some examples related to Conway Groupoids

... For instance, it may be the case that a and b correspond to the vertices of a graph with [a, b] only being defined when a and b are a certain distance apart from one another. We could then define [a, b] to be an ...

10

Multivariate normal approximation in geometric probability

Multivariate normal approximation in geometric probability

... Beyond the context of geometric probability, multivariate central limit theory has been well studied. Related results include multivariate central limit theorems for sums of independent random variables ...

30

Labelings on Jahangir Graph and Extended Duplicate Graph of Jahangir Graph

Labelings on Jahangir Graph and Extended Duplicate Graph of Jahangir Graph

... a graph G with vertex set V is a function from V(G) to {0,1} such that if each edge uv is assigned the label f(u)f(v), the number of vertices labeled ‘0’ and the number of vertices labeled ‘1’ differ by atmost 1 ...

9

Minimum Covering Randić Energy of a Graph

Minimum Covering Randić Energy of a Graph

... star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship ...

17

Asymptotics in directed exponential random graph models with an increasing bi degree sequence

Asymptotics in directed exponential random graph models with an increasing bi degree sequence

... It is worth to note that the above discussions only consider independent edges. Exponential random graph models (ERGMs), sometimes referred as exponential- family random graph models, for example, [27, 44], ...

28

A case of hedonic perception of foreigners towards Chinese culture-specific odors from scent marketing perspective

A case of hedonic perception of foreigners towards Chinese culture-specific odors from scent marketing perspective

... The graph above shows that when exposed to the smell of Chinese traditional medicine herbs, ethnic groups South and Central Asian tend to choose 1 (Unpleasant) feelings; Sou[r] ...

24

Statistics in Focus  Economy and finance  Structure of government debt in the European Union  1999 33

Statistics in Focus Economy and finance Structure of government debt in the European Union 1999 33

... Graph 4: Debt guaranteed by central government, % of total debt, 1998 * Data for France, Germany and UK are from 1997 * * Data are qualified as provisional 50%, Luxembourg and Ireland.. [r] ...

8

Graph Databases and DBMSs - Free Computer, Programming, Mathematics, Technical Books, Lecture Notes and Tutorials

Graph Databases and DBMSs - Free Computer, Programming, Mathematics, Technical Books, Lecture Notes and Tutorials

... Graph databases support algorithms to perform concrete queries that are out of reach to relational databases, for their tabular structure and static schema. Also, the bigger the volume of data, the slower the ...

81

The Neighborhood Graph of a Graph

The Neighborhood Graph of a Graph

... Several graph valued functions in graph theory were studied, for example, in [4, 5, 6, 7, 8, 9, 10, 11, 12,13, 14, 15, 16] and also several graph valued functions in domination theory were studied, ...

8

Thesis

Thesis

... As we can see, in Figure 1, the Von Neumann entropy of Erd˝ os-R´ enyi random networks with N = 112 vertices and M = 425 edges are mostly in the range of [6.57, 6.66]. However, as we will see in the next numerical ...

29

Show all 10000 documents...

Related subjects