Preview

On The Transformation and Transformation Number of Special Graphs

Good Essays
Open Document
Open Document
6245 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
On The Transformation and Transformation Number of Special Graphs
On The Transformation and
Transformation Number of Special Graphs

A Special Problem
Presented to the Faculty of the
Department of Mathematics and Statistics
College of Arts and Sciences
University of Southeastern Philippines

In Partial Fulfillment of the Requirements for the Degree of
Bachelor of Science in Mathematics

Romelyn D. Villamor
April 2009

Abstract

This paper introduces a new operation on graphs called transformation. A transformation is applicable on simple connected graphs. A onetransformation of a graph G is a graph obtained by joining pairs of nonadjacent vertices of G resulting to an increase in the degree of each vertex by one. If the graph can have a one-transformation then the graph is a onetransformer or a transformer. An n-transformation of a graph G is obtained by performing n number of one-transformation on G. A graph is n-transformer if it can perform n number of one-transformation.
This paper presents the transformation and the transformation number of some special graphs such as path graphs, cycle graphs, complete bipartite graphs, fans, and generalized fans.

To my family

and

friends this work is whole-heartedly dedicated. . . .

“It is good to give thanks to the Lord, to sing praise to your name, Most
High. . . ”
Psalm 92:2

Table of Contents
Page
Title Page . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i Approval Sheet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii
Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii
Dedication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv
Acknowledgment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v
Table of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . .



Bibliography: [1] Behzad, M. and Chartrand G., Introduction to the Graph Theory, Allyn and Bocon Publishing Co., Inc., 1971. [2] Berge, C., Graphs and Hypergraphs, Amsterdam Publishing Co.,Inc., 1973. [3] Bondy, J.A. and Murty U.S.R, Graph Theory with Applications, Elsevier Science Publishing Co., Inc., 1982. [4] Harary, F., Graph Theory, Addison-Wesley Publishing Company, Inc., 1969. [5] Lui, C.L., Introduction to Combinatorial Mathematics, McGraw-Hill Publishing Co., Inc., 1968. [6] Ore, O., Graph and Their Uses, Random House Publishing Co., Inc., 1963. [7] Wilson, R.J., Introduction to Graph Theory, Oliver and Boyd Publishing Co., Inc., 1972.

You May Also Find These Documents Helpful

  • Good Essays

    where (i, j) representing a link between node i and node j. n is the total number of nodes in the network.…

    • 596 Words
    • 3 Pages
    Good Essays
  • Good Essays

    You are an electrical engineer designing a new integrated circuit involving potentially millions of components. How would you use graph theory to organize how many layers your chip must have to handle all of the interconnections? Which properties of graphs come into play in such a circumstance?…

    • 2006 Words
    • 7 Pages
    Good Essays
  • Good Essays

    We focus our attention on unweighted and undirected networks here. A complex network is represented by G(V,E) where V is the vertex set and E is the edge set. Each node v(v∈V) has a label C(v) and N(v) is the set of neighbors of node . The label propagation algorithm (LPA) first initializes every node with a unique label. Then at every step each node updates its current label to the label shared by the maximum number of its neighbors. The formula is as follows [14]:…

    • 480 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    MATH203 PHASE3

    • 268 Words
    • 1 Page

    Since there is one simple path between any pair of nodes the graph is a tree. The root node of the…

    • 268 Words
    • 1 Page
    Satisfactory Essays
  • Powerful Essays

    Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . III…

    • 2624 Words
    • 11 Pages
    Powerful Essays
  • Satisfactory Essays

    Mastering Graduate Studies 1e

    • 32487 Words
    • 167 Pages

    Table of Contents. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .…

    • 32487 Words
    • 167 Pages
    Satisfactory Essays
  • Powerful Essays

    Berlin: Brücke-Museum, 1999. Schiefler, Gustav, and Christel Mosel. Emil Nolde: Das graphische Werk. 2 vols. Cologne: DuMont, 1995. Vergo, Peter, and Felicity Lunn, eds.…

    • 1554 Words
    • 7 Pages
    Powerful Essays
  • Good Essays

    O(1) O(n) O(n) O(1) Graph with |V| vertices and |E| edges O((|V| + |E|) log |V|) O((|V| + |E|) log |V|) O(|V|) Graph with |V| vertices and |E| edges O(|V|^2) O(|V|^2) O(|V|) Graph with |V| vertices and |E| edges O(|V||E|) O(|V||E|) O(|V|) Average Breadth First Search (BFS) Binary search Linear (Brute Force)…

    • 990 Words
    • 18 Pages
    Good Essays
  • Better Essays

    Acknowledgements_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ Pg 4…

    • 3783 Words
    • 16 Pages
    Better Essays
  • Better Essays

    Networks are everywhere. The brain is a sophisticated neural network connected by axons. Society, too, are networks connected by family, friends and professional ties. On a larger scale food webs can be represented as a network of species. Networks have even diffused through our technology such as the World Wide Web where routers and web pages are all interconnected. Even the language we speak today is a network of words connected by syntactic associations. Networks are everywhere.…

    • 1598 Words
    • 7 Pages
    Better Essays
  • Good Essays

    Salem Witch Trials

    • 2719 Words
    • 8 Pages

    "The whole life of a Christian should be nothing but praises and thanks to God; we should neither eat nor sleep, but eat to God and sleep to God and work to God and talk to God, do all to His glory and praise.” — Richard Sibbes (Puritan Minister)…

    • 2719 Words
    • 8 Pages
    Good Essays
  • Powerful Essays

    Graphology

    • 2039 Words
    • 9 Pages

    3. The science of Grapho- Analysis is a vast topic and it would not be possible to do full justice to it in the time allotted. So my talk would be restricted to primarily providing the audience with a broad over view of the subject only .The topic would be covered under the following heads:-…

    • 2039 Words
    • 9 Pages
    Powerful Essays
  • Powerful Essays

    Budget Constraint

    • 9477 Words
    • 38 Pages

    TITLE PAGE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .…

    • 9477 Words
    • 38 Pages
    Powerful Essays
  • Satisfactory Essays

    Getting and Processing data from Twitter: Firstly, by “import tool” in NodeXL plug-in for Microsoft Excel, I searched for people whose tweets contains the key word “Julian Assange”, and ticked to all of three boxes “Follows”, “Replies-to”, and “Mentions relation” with the 100 people limitation so that I could get a stronger-connected graph. However, in some first searches, I could not get a reasonable graph as I expected due to 2 reasons. The first one is the limitation number was small, and I chose the box “I don’t have a twitter account” was another reason. And the graph was really weak-connected because there were only 4 or 5 edges and about over 90 single points. So I was not able to apply the “graph metrics” contents to consider these graphs. Then I registered to use twitter account to import more than 100 people data. This time I also used the key word “Julian Assange” but with the limitation up to 300 people. After that, I got 300 people whose tweets contain “Julian Assange”, and the graph was stronger-connected. Then I calculated all numbers by “Graph Metrics” tool, and removed some points which have zero degree in both of “in-degree” and “out-degree” in order that we can examine and deduce information more easily from the graph.…

    • 1246 Words
    • 5 Pages
    Satisfactory Essays
  • Better Essays

    Minimum Spanning Tree

    • 2477 Words
    • 10 Pages

    Minimum Spanning Tree MST. Given connected graph G with positive edge weights, find a min weight set of edges that connects all of the vertices. Minimum Spanning Tree 24 4 23 6 9 18 • • • • • • • 5 introduction Weighted graph API cycles and cuts Kruskal’s algorithm Prim’s algorithm advanced algorithms clustering 11 16 8 10 14 7 21 G References: Algorithms in Java (Part 5), Chapter 20…

    • 2477 Words
    • 10 Pages
    Better Essays

Related Topics