Sun Yuefang (24 results)

Condition: New.

Paperback. Condition: New. 2012 ed. Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006. The authors begin with an introduction to rainbow connectedness, rainbow coloring, and  rainbow connection number. The work is organized into the following categories, computation of the exact values of the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters, rainbow connection for dense and sparse graphs, for some graph classes and graph products, rainbow k-connectivity and k-rainbow index, and, rainbow vertex-connection number.Rainbow Connections of Graphs appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the  hope for motivating young graph theorists and graduate students to do further study in this subject.

Condition: As New. Unread book in perfect condition.

Condition: New. In.

Condition: New.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: new. Paperback. Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. The corresponding problems in digraphs are called directed Steiner type packing problems which are highly related to some important problems in graph theory.In this book, the author tried to collect known results on several Steiner type packing problems in digraphs, including directed Steiner tree packing problem, directed Steiner path packing problem, strong subgraph packing problem, strong arc decomposition problem, directed Steiner cycle packing problem. This book also contains some conjectures and open problems for further study. The author hopes this book can motivate more young researchers and graduate students to do further study in this subject, and promote the interdisciplinary research of graph theory, combinatorial optimization, theoretical computer science and communication networks. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condition: New. pp. 112.

Paperback. Condition: Brand New. 105 pages. 8.75x5.75x0.25 inches. In Stock.

Condition: New.

Paperback. Condition: Brand New. 90 pages. 6.10x0.21x9.25 inches. In Stock.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. The corresponding problems in digraphs are called directed Steiner type packing problems which are highly related to some important problems in graph theory.In this book, the author tried to collect known results on several Steiner type packing problems in digraphs, including directed Steiner tree packing problem, directed Steiner path packing problem, strong subgraph packing problem, strong arc decomposition problem, directed Steiner cycle packing problem. This book also contains some conjectures and open problems for further study.The author hopes this book can motivate more young researchers and graduate students to do further study in this subject, and promote the interdisciplinary research of graph theory, combinatorial optimization, theoretical computer science and communication networks.

Taschenbuch. Condition: Neu. Steiner Type Packing Problems in Digraphs | Yuefang Sun | Taschenbuch | SpringerBriefs in Mathematics | xi | Englisch | 2026 | Springer | EAN 9789819587421 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Condition: New. 2012 ed. Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006. The authors begin with an introduction to rainbow connectedness, rainbow coloring, and  rainbow connection number. The work is organized into the following categories, computation of the exact values of the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters, rainbow connection for dense and sparse graphs, for some graph classes and graph products, rainbow k-connectivity and k-rainbow index, and, rainbow vertex-connection number.Rainbow Connections of Graphs appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the  hope for motivating young graph theorists and graduate students to do further study in this subject.

Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006. The authors begin with an introduction to rainbow connectedness, rainbow coloring, and  rainbow connection number. The work is organized into the following categories, computation of the exact values of the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters, rainbow connection for dense and sparse graphs, for some graph classes and graph products, rainbow k-connectivity and k-rainbow index, and, rainbow vertex-connection number. Rainbow Connections of Graphs appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the  hope for motivating young graph theorists and graduate students to do further study in this subject.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. The corresponding problems in digraphs are called directed Steiner type packing problems which are highly related to some important problems in graph theory.In this book, the author tried to collect known results on several Steiner type packing problems in digraphs, including directed Steiner tree packing problem, directed Steiner path packing problem, strong subgraph packing problem, strong arc decomposition problem, directed Steiner cycle packing problem. This book also contains some conjectures and open problems for further study.The author hopes this book can motivate more young researchers and graduate students to do further study in this subject, and promote the interdisciplinary research of graph theory, combinatorial optimization, theoretical computer science and communication networks. 79 pp. Englisch.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006. The authors begin with an introduction to rainbow connectedness, rainbow coloring, and rainbow connection number. The work is organized into the following categories, computation of the exact values of the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters, rainbow connection for dense and sparse graphs, for some graph classes and graph products, rainbow k-connectivity and k-rainbow index, and, rainbow vertex-connection number.Rainbow Connections of Graphs appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the hope for motivating young graph theorists and graduate students to do further study in this subject. 112 pp. Englisch.

Condition: New. Print on Demand pp. 112 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condition: New. Print on Demand.

Condition: New. PRINT ON DEMAND pp. 112.

Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. a|Rainbow connection is a new topic in the field of graph theory Organized into five categories rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt.

Condition: New. PRINT ON DEMAND.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. The corresponding problems in digraphs are called directed Steiner type packing problems which are highly related to some important problems in graph theory.In this book, the author tried to collect known results on several Steiner type packing problems in digraphs, including directed Steiner tree packing problem, directed Steiner path packing problem, strong subgraph packing problem, strong arc decomposition problem, directed Steiner cycle packing problem. This book also contains some conjectures and open problems for further study. The author hopes this book can motivate more young researchers and graduate students to do further study in this subject, and promote the interdisciplinary research of graph theory, combinatorial optimization, theoretical computer science and communication networks.Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg 92 pp. Englisch.