• No results found

[PDF] Top 20 Further Results on Pair Sum Graphs

Has 10000 "Further Results on Pair Sum Graphs" found on our website. Below are the top 20 most common "Further Results on Pair Sum Graphs".

Further Results on Pair Sum Graphs

Further Results on Pair Sum Graphs

... of pair sum labeling has been introduced in [1]. The Pair sum labeling behavior of some standard graphs like complete graph, cycle, path, bistar, and some more standard graphs ... See full document

9

Further Results on Pair Sum Labeling of Trees

Further Results on Pair Sum Labeling of Trees

... a pair sum labeling is called a pair sum ...the pair sum label- ing behavior of some trees which are derived from stars and ...are pair sum ... See full document

9

On the General Sum–Connectivity Co–Index of Graphs

On the General Sum–Connectivity Co–Index of Graphs

... This invariant was introduced in the hope of improving our ability to quantify the contribution of pairs of non–adjacent vertices to properties of graphs. We encourage the interested reader to [7] for some recent ... See full document

10

Some New Results on Sum Divisor Cordial Graphs

Some New Results on Sum Divisor Cordial Graphs

... By a graph, we mean a finite undirected graph without loops or multiple edges. For standard terminology and notations related to graph theory we refer [4] . A labeling of graph is a map that carries the graph elements to ... See full document

8

Edge pair sum labeling of some cycle related graphs

Edge pair sum labeling of some cycle related graphs

... a pair sum labeling, it is called a pair sum ...to pair sum labeling we defined a new labeling called edge pair sum labeling [3] and further studied in ... See full document

12

Pair Sum Labeling of some Special Graphs

Pair Sum Labeling of some Special Graphs

... Definition 1.7: A binary tree is defined as a tree in which there is exactly one vertex (root vertex) of degree two and each of the remaining vertices is of degree one or three. A d- level complete binary tree (complete ... See full document

5

Sum Distance in Fuzzy Graphs

Sum Distance in Fuzzy Graphs

... some pair of nodes ...other pair of nodes ...are further classified as α−strong & β−strong and the remaining arcs are termed as δ−arcs [24] as ... See full document

17

Further Results on Sum Cordial Graphs

Further Results on Sum Cordial Graphs

... several results on this newly defined concept. Also, some new graphs are investigated as product cordial graphs by Vaidya ...called sum cordial labeling if | v f ( 0 ) − v f ( 1 )| ≤ 1 and | e ... See full document

7

Degree Sum Energy of Some Graphs

Degree Sum Energy of Some Graphs

... = + 6 4 5 − 6 8 7 − − 2 6 + 9999999999999: 6 8 7 Ψ %"#$& : γ ' = ( +6) (n-2) % − 6 − 2 − − 1 + 2 ' . On computing eigen values and adding their absolute values theorem follows. Theorem 2.2 The degree sum ... See full document

11

A note on eccentric distance sum

A note on eccentric distance sum

... the sum of distances of all vertices in G from v ...distance sum of Volkmann tree and then we obtain some results for vertex−transitive graphs ... See full document

5

Further Properties of Reproducing Graphs

Further Properties of Reproducing Graphs

... The total number of strongly decreasing partitions of d (of any length), and hence also the number of non-jumping binary partitions of any length, is sequence A040039 in the OEIS, [12] (this can be seen by using the ... See full document

7

Tetrahedral and Pentatopic Sum Labeling of Graphs

Tetrahedral and Pentatopic Sum Labeling of Graphs

... pentatopic sum la- beling if its vertices can be labeled by non negative integers such that the induced edge labels obtained by the sum of the labels of end vertices are the first q tetrahedral or pentatope ... See full document

5

Zero sum partition theorems for graphs

Zero sum partition theorems for graphs

... A partial sample of the problems evolved from Gallai’s theorem is: PROBLEM 1: What is the maximum order of an induced subgraph // of a graph G, with n non-isolated vertices, such that in[r] ... See full document

6

On the Eigenvalues of Rhomboidal C4C8(R)[n; n] Nanotori

On the Eigenvalues of Rhomboidal C4C8(R)[n; n] Nanotori

... At the end of this paper, using Theorem 3, we give lower and upper bounds for an important chemical quantity, namely Estrada index, for the graph. The Estrada index EE ( ) of the graph  is defined as the sum of ... See full document

10

On the Absolute Sum of Chromatic
Polynomial Coefficient of Graphs

On the Absolute Sum of Chromatic Polynomial Coefficient of Graphs

... G − WG W denote the subgraph of G obtained by deleting adding the vertices of W and the edges incident with them. G · xy is the graph obtained from G by contracting x and y and removing any loop and all but one of the ... See full document

7

Some bistar related square sum graphs

Some bistar related square sum graphs

... Labeled graphs have broad range of applications in different fields such as coding theory, particu- larly in the development of missile guidance codes, design of radar type codes and convolution codes with optimal ... See full document

6

Topological Indices of the Total Graph of Subdivision Graphs

Topological Indices of the Total Graph of Subdivision Graphs

... Proof: In G, there are 7n+1 nodes, among which 3n nodes of valency five, 2n nodes of valency four, n nodes of valency six, n nodes of valency n+2 and one node of valency 2n. Thus by Handshaking lemma the total number of ... See full document

5

On Direct Sum of Two Intuitionistic Fuzzy Graphs

On Direct Sum of Two Intuitionistic Fuzzy Graphs

... M.G.Karunambigai and R.Parvathi, Intuitionistic Fuzzy Graphs, Proceedings of 9 th Fuzzy Days International Conference on Computational Intelligence, Advances in Soft Computing, Computati[r] ... See full document

6

The sharp bounds on general sum connectivity index of four operations on graphs

The sharp bounds on general sum connectivity index of four operations on graphs

... The idea to obtain the bounds for the four operations of the graphs for general sum-connectivity index of the graphs was proposed by MI. After several discussions, SA obtained some sharp bounds for ... See full document

10

Reciprocal Graphs

Reciprocal Graphs

... reciprocal graphs and an upperbound for their energy is ...reciprocal graphs on n ≡ 0 mod ( 12 ) and n ≡ 0 mod ( 16 ) are ...reciprocal graphs are also obtained. These results are not found so ... See full document

8

Show all 10000 documents...