Книга: Mohammed Seoud,Manal Harere and Mohammed Anwar «Combination and Permutation Graphs»
|
Производитель: "LAP Lambert Academic Publishing" Most graph labeling methods trace their origin to one introduced by Alex Rosa, through the paper `On certain valuations of the vertices of a graph`, which was presented in the International Symposium, held in Rome, July 1966,Gordon and Breach, N. Y. and Dunod Paris (1967) 349-355, or one given by R. L. Graham and N. J. A. Sloane, through the paper `On additive bases and harmonious graphs`, SIAM J. Alg. Discrete Meth., 1 (1980) 382-404. Labeled graphs became a very useful tool for treating many problems in different branches of science, e. g. Electrical Networks, Coding Theory, Astronomy, X-Ray Crystallographic analysis. S. M. Hegde and S. Shetty defined what is called `Permutation and Combination Labelings`. This book consists of some papers which give some rich additions to these two types of labelings. ISBN:9783659491085 Издательство: "LAP Lambert Academic Publishing" (2013)
ISBN: 9783659491085 |
См. также в других словарях:
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Order (mathematics) — Contents 1 In algebra 2 In arithmetic 3 In analysis 4 … Wikipedia
Matrix theory — is a branch of mathematics which focuses on the study of matrices. Initially a sub branch of linear algebra, it has grown to cover subjects related to graph theory, algebra, combinatorics, and statistics as well.HistoryThe term matrix was first… … Wikipedia
The Art of Computer Programming — [ [http://www cs faculty.stanford.edu/ uno/taocp.html The Art of Computer Programming ] ] is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis. Knuth began the project, which was … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Root system — This article discusses root systems in mathematics. For root systems of plants, see root. Lie groups … Wikipedia
