Pair Difference Cordial Labeling of Some Trees and Some Graphs Derived From Cube GraphPonraj, R.Gayathri, A.Somasundaram, S.International Journal of Mathematical Combinatorics
Point of View: It's Personal Plural and Possessive Names: A Guide What's the difference between 'fascism' and 'socialism'? More Commonly Misspelled Words Words You Always Have to Look Up Popular in Wordplay See All 8 Words with Fascinating Histories ...
Square Difference labeling for Complete Bipartite Graphs and Trees Let G be a graph with p vertices and q edges. A square difference labeling of a graph G is a bijection f : V (G)→{0, 1, 2..., p 1}, such that the induced function f : E(G)→N defined by f(uv) =| [f(...
Summary: A graph, like a tree, is a collection of nodes and edges, but has no rules dictating the connection among the nodes. In this fifth part of the article series, we'll learn all about graphs, one of the most versatile data structures.(22 printed pages)...
This formulation generalizes the Haar-like features of [15], the summed rectan- gular features of [16] and the pixel difference features of [3]. The generalization of features is important because it allows us to execute the same code for all the nodes in a decision tree, varying only ...
The baobab trees (genus Adansonia) have attracted tremendous attention because of their striking shape and distinctive relationships with fauna1. These spectacular trees have also influenced human culture, inspiring innumerable arts, folklore and traditi
We consider the stochastic graph model where the location of each vertex is a random point in a given metric space. We study the problems of computing the expected lengths of the minimum spanning tree, the minimum perfect matching and th... L Huang,L Jian - 《Lecture Notes in Computer Sci...
Two players, Alice and Bob, take turns colouring the vertices of G with colours from X. A partial colouring c of G is legal (with respect to graph function f) if for any subgraph H of G, the sum of the number of colours used in H and the number of uncoloured vertices of H is ...
We show that restricting the problem to trees yields a polynomially solvable case, as long as k is either constant or has a constant difference with n, the number of vertices in the tree. Finally, we prove that cographs are always k-role-colourable for 1<k≤n and construct such a ...
difference between gene tree and species tree and the causes behind should be fully appreciated in molecular phylogenetic studies. In this paper, we have explored the major causes resulting in conflicting gene trees, including stochastic errors, systematic errors and biological factors. We also ...