Decomposition of complete tripartite graphs into gregarious 4-cycles

A 4-cycle in a tripartite graph with vertex partition {V-1, V-2, V-3} is said to be gregarious if it has at least one vertex in each V-i, 1 less than or equal to i less than or equal to 3. In this paper, necessary and sufficient conditions are given for the existence of an edge-disjoint decomposition of any complete tripartite graph into gregarious 4-cycles.

Common multiples of complete graphs

A graph H is said to divide a graph G if there exists a set S of subgraphs of G, all isomorphic to H, such that the edge set of G is partitioned by the edge sets of the subgraphs in S. Thus, a graph G is a common multiple of two graphs if each of the two graphs divides G.

Public policy in knowledge-based economies: Foundations and frameworks

Knowledge is a product of human social systems and, therefore, the foundations of the knowledge-based economy are social and cultural. Communication is central to knowledge creation and diffusion, and Public Policy in Knowledge-Based Economies highlights specific social and cultural conditions that can enhance the communication, use and creation of knowledge in a society.The purpose of this book is to illustrate how these social and cultural conditions are identified and analysed through new conceptual frameworks. Such frameworks are necessary to penetrate the surface features of knowledge-based economies - science and technology - and disclose what drives such economies.This book will provide policymakers, analysts and academics with the fundamental tools needed for the development of policy in this little understood and emerging area.