On m-Bonacci-Sum Graphs
14 Feb 2019-pp 65-76
TL;DR: The notion of m-bonacci-sum graphs denoted by \(G_{m,n}\) for positive integers m, n are introduced and it is shown that this graph is bipartite and for \(n\ge 2^{m-2}\), \(\{1,2,\ldots ,n\) has exactly \((m-1)\) components.
Abstract: We introduce the notion of m-bonacci-sum graphs denoted by \(G_{m,n}\) for positive integers m, n. The vertices of \(G_{m,n}\) are \(1,2,\ldots ,n\) and any two vertices are adjacent if and only if their sum is an m-bonacci number. We show that \(G_{m,n}\) is bipartite and for \(n\ge 2^{m-2}\), \(G_{m,n}\) has exactly \((m-1)\) components. We also find the values of n such that \(G_{m,n}\) contains cycles as subgraphs. We also use this graph to partition the set \(\{1,2,\ldots ,n\}\) into \(m-1\) subsets such that each subset is ordered in such a way that sum of any 2 consecutive terms is an m-bonacci number.
...read more
Citations
More filters
TL;DR: A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set { 0, 1, 2, …, Z n, m...
Abstract: We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set {0,1,2,…,Zn,m} such that ...
References
More filters
Book•
14 Nov 1995
TL;DR: In this article, the authors introduce the concept of graph coloring and propose a graph coloring algorithm based on the Eulers formula for k-chromatic graphs, which can be seen as a special case of the graph coloring problem.
Abstract: 1. Fundamental Concepts. Definitions and examples. Paths and proofs. Vertex degrees and counting. Degrees and algorithmic proof. 2. Trees and Distance. Basic properties. Spanning trees and enumeration. Optimization and trees. Eulerian graphs and digraphs. 3. Matchings and Factors. Matchings in bipartite graphs. Applications and algorithms. Matchings in general graphs. 4. Connectivity and Paths. Cuts and connectivity. k-connected graphs. Network flow problems. 5. Graph Coloring. Vertex colorings and upper bounds. Structure of k-chromatic graphs. Enumerative aspects. 6. Edges and Cycles. Line graphs and edge-coloring. Hamiltonian cycles. Complexity. 7. Planar Graphs. Embeddings and Eulers formula. Characterization of planar graphs. Parameters of planarity. 8. Additional Topics. Perfect graphs. Matroids. Ramsey theory. More extremal problems. Random graphs. Eigenvalues of graphs. Glossary of Terms. Glossary of Notation. References. Author Index. Subject Index.
7,114 citations
Book•
[...]
14 Aug 2008
TL;DR: This book provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal, and is suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science.
Abstract: Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics computer science, combinatorial optimization, and operations research in particular but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication networks, for instance. The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided to help the reader master the techniques and reinforce their grasp of the material. A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters. Visit the graph theory book blog at: http://blogs.springer.com/bondyandmurty/.
3,061 citations
Book•
01 Jan 2002
TL;DR: In the context of fractals, Chaos, plant growth and other Dynamical Systems: Self-Referential Systems Nature's Number System Number: Gray Code and the Towers of Hanoi Gray Code, Sets, and Logic Chaos Theory: A Challenge to Predictability Fractals Chaos and Fractals as discussed by the authors.
Abstract: Essays in Geometry and Number as They Arise in Nature, Music, Architecture and Design: The Spiral in Nature and Myth The Vortex of Life Harmonic Law The Projective Nature of the Musical Scale The Music of the Spheres Tangrams and Amish Quilts Linking Proportions, Architecture, and Music A Secret of Ancient Geometry The Hyperbolic Brunes Star The Hidden Pavements of the Laurentian Library Measure in Megalithic Britain The Flame-hand Letters of the Hebrew Alphabet Concepts Described in Part I Reappear in the Context of Fractals, Chaos, Plant Growth and Other Dynamical Systems: Self-Referential Systems Nature's Number System Number: Gray Code and the Towers of Hanoi Gray Code, Sets, and Logic Chaos Theory: A Challenge to Predictability Fractals Chaos and Fractals The Golden Mean Generalizations of the Golden Mean -- I Generalizations of the Golden Mean -- Il Polygons and Chaos Growth of Plants: A Study in Number Dynamical Systems.
30 citations
TL;DR: In this paper, two new summation formulas for M-bonacci numbers are given, which are generalizations of the two summation formula for Fibonacci numbers, and the formulas are shown to be equivalent to the two formulas for the M-Bonacci numbers.
Abstract: The note considers M-bonacci numbers, which are a generalization of Fibonacci numbers. Two new summation formulas for M-bonacci numbers are given. The formulas are generalizations of the two summation formulas for Fibonacci numbers.
8 citations
TL;DR: In this article, two summation formulas for sequences with M-bonacci property were derived and applied to the arithmetic series, mth g − gonal numbers and the Fibonacci series.
Abstract: The note introduces sequences having M-bonacci property. Two summation formulas for sequences with M-bonacci property are derived. The formulas are generalizations of corresponding summation formulas for both M-bonacci numbers and Fibonacci numbers that have appeared previously in the literature. Applications to the Arithmetic series, mth g − gonal numbers and the Fibonacci series are demonstrated.
7 citations