410 research outputs found
Generalized Colorings of Graphs
A graph coloring is an assignment of labels called “colors” to certain elements of a graph subject to certain constraints. The proper vertex coloring is the most common type of graph coloring, where each vertex of a graph is assigned one color such that no two adjacent vertices share the same color, with the objective of minimizing the number of colors used. One can obtain various generalizations of the proper vertex coloring problem, by strengthening or relaxing the constraints or changing the objective. We study several types of such generalizations in this thesis. Series-parallel graphs are multigraphs that have no K4-minor. We provide bounds on their fractional and circular chromatic numbers and the defective version of these pa-rameters. In particular we show that the fractional chromatic number of any series-parallel graph of odd girth k is exactly 2k/(k − 1), confirming a conjecture by Wang and Yu. We introduce a generalization of defective coloring: each vertex of a graph is assigned a fraction of each color, with the total amount of colors at each vertex summing to 1. We define the fractional defect of a vertex v to be the sum of the overlaps with each neighbor of v, and the fractional defect of the graph to be the maximum of the defects over all vertices. We provide results on the minimum fractional defect of 2-colorings of some graphs. We also propose some open questions and conjectures. Given a (not necessarily proper) vertex coloring of a graph, a subgraph is called rainbow if all its vertices receive different colors, and monochromatic if all its vertices receive the same color. We consider several types of coloring here: a no-rainbow-F coloring of G is a coloring of the vertices of G without rainbow subgraph isomorphic to F ; an F -WORM coloring of G is a coloring of the vertices of G without rainbow or monochromatic subgraph isomorphic to F ; an (M, R)-WORM coloring of G is a coloring of the vertices of G with neither a monochromatic subgraph isomorphic to M nor a rainbow subgraph isomorphic to R. We present some results on these concepts especially with regards to the existence of colorings, complexity, and optimization within certain graph classes. Our focus is on the case that F , M or R is a path, cycle, star, or clique
Advances in Discrete Applied Mathematics and Graph Theory
The present reprint contains twelve papers published in the Special Issue “Advances in Discrete Applied Mathematics and Graph Theory, 2021” of the MDPI Mathematics journal, which cover a wide range of topics connected to the theory and applications of Graph Theory and Discrete Applied Mathematics. The focus of the majority of papers is on recent advances in graph theory and applications in chemical graph theory. In particular, the topics studied include bipartite and multipartite Ramsey numbers, graph coloring and chromatic numbers, several varieties of domination (Double Roman, Quasi-Total Roman, Total 3-Roman) and two graph indices of interest in chemical graph theory (Sombor index, generalized ABC index), as well as hyperspaces of graphs and local inclusive distance vertex irregular graphs
Optimization Methods for Cluster Analysis in Network-based Data Mining
This dissertation focuses on two optimization problems that arise in network-based data mining, concerning identification of basic community structures (clusters) in graphs: the maximum edge weight clique and maximum induced cluster subgraph problems. We propose a continuous quadratic formulation for the maximum edge weight clique problem, and establish the correspondence between its local optima and maximal cliques in the graph. Subsequently, we present a combinatorial branch-and-bound algorithm for this problem that takes advantage of a polynomial-time solvable nonconvex relaxation of the proposed formulation. We also introduce a linear-time-computable analytic upper bound on the clique number of a graph, as well as a new method of upper-bounding the maximum edge weight clique problem, which leads to another exact algorithm for this problem. For the maximum induced cluster subgraph problem, we present the results of a comprehensive polyhedral analysis. We derive several families of facet-defining valid inequalities for the IUC polytope associated with a graph. We also provide a complete description of this polytope for some special classes of graphs. We establish computational complexity of the separation problems for most of the considered families of valid inequalities, and explore the effectiveness of employing the corresponding cutting planes in an integer (linear) programming framework for the maximum induced cluster subgraph problem
THE ELECTRONIC JOURNAL OF COMBINATORICS (2014), DS1.14 References
and Computing 11. The results of 143 references depend on computer algorithms. The references are ordered alphabetically by the last name of the first author, and where multiple papers have the same first author they are ordered by the last name of the second author, etc. We preferred that all work by the same author be in consecutive positions. Unfortunately, this causes that some of the abbreviations are not in alphabetical order. For example, [BaRT] is earlier on the list than [BaLS]. We also wish to explain a possible confusion with respect to the order of parts and spelling of Chinese names. We put them without any abbreviations, often with the last name written first as is customary in original. Sometimes this is different from the citations in other sources. One can obtain all variations of writing any specific name by consulting the authors database of Mathematical Reviews a
Graph Theory
Graph theory is a rapidly developing area of mathematics. Recent years have seen the development of deep theories, and the increasing importance of methods from other parts of mathematics. The workshop on Graph Theory brought together together a broad range of researchers to discuss some of the major new developments. There were three central themes, each of which has seen striking recent progress: the structure of graphs with forbidden subgraphs; graph minor theory; and applications of the entropy compression method. The workshop featured major talks on current work in these areas, as well as presentations of recent breakthroughs and connections to other areas. There was a particularly exciting selection of longer talks, including presentations on the structure of graphs with forbidden induced subgraphs, embedding simply connected 2-complexes in 3-space, and an announcement of the solution of the well-known Oberwolfach Problem
Modeling and Tuning of Energy Harvesting Device Using Piezoelectric Cantilever Array
Piezoelectric devices have been increasingly investigated as a means of converting ambient vibrations into electrical energy that can be stored and used to power other devices, such as the sensors/actuators, micro-electro-mechanical systems (MEMS) devices, and microprocessor units etc. The objective of this work was to design, fabricate, and test a piezoelectric device to harvest as much power as possible from vibration sources and effectively store the power in a battery.;The main factors determining the amount of collectable power of a single piezoelectric cantilever are its resonant frequency, operation mode and resistive load in the charging circuit. A proof mass was used to adjust the resonant frequency and operation mode of a piezoelectric cantilever by moving the mass along the cantilever. Due to the tiny amount of collected power, a capacitor was suggested in the charging circuit as an intermediate station. To harvest sufficient energy, a piezoelectric cantilever array, which integrates multiple cantilevers in parallel connection, was investigated.;In the past, most prior research has focused on the theoretical analysis of power generation instead of storing generated power in a physical device. In this research, a commercial solid-state battery was used to store the power collected by the proposed piezoelectric cantilever array. The time required to charge the battery up to 80% capacity using a constant power supply was 970 s. It took about 2400 s for the piezoelectric array to complete the same task. Other than harvesting energy from sinusoidal waveforms, a vibration source that emulates a real environment was also studied. In this research the response of a bridge-vehicle system was used as the vibration sources such a scenario is much closer to a real environment compared with typical lab setups
Roman Domination in Complementary Prism Graphs
A Roman domination function on a complementary prism graph GGc is a function f : V [ V c ! {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number R(GGc) of a graph G = (V,E) is the minimum of Px2V [V c f(x) over such functions, where the complementary prism GGc of G is graph obtained from disjoint union of G and its complement Gc by adding edges of a perfect matching between corresponding vertices of G and Gc. In this paper, we have investigated few properties of R(GGc) and its relation with other parameters are obtaine
Fractional refinements of integral theorems
The focus of this thesis is to take theorems which deal with ``integral" objects in graph theory and consider fractional refinements of them to gain additional structure.
A classic theorem of Hakimi says that for an integer , a graph has maximum average degree at most if and only if the graph decomposes into pseudoforests. To find a fractional refinement of this theorem, one simply needs to consider the instances where the maximum average degree is fractional.
We prove that for any positive integers and , if has maximum average degree at most , then decomposes into pseudoforests, where one of pseudoforests has every connected component containing at most edges, and further this pseudoforest is acyclic. The maximum average degree bound is best possible for every choice of and .
Similar to Hakimi's Theorem, a classical theorem of Nash-Williams says that a graph has fractional arborcity at most if and only if decomposes into forests. The Nine Dragon Tree Theorem, proven by Jiang and Yang, provides a fractional refinement of Nash-Williams Theorem. It says, for any positive integers and , if a graph has fractional arboricity at most , then decomposes into forests, where one of the forests has maximum degree .
We prove a strengthening of the Nine Dragon Tree Theorem in certain cases. Let and . Every graph with fractional arboricity at most decomposes into two forests and where has maximum degree , every component of contains at most one vertex of degree , and if , then every component of contains at most edges such that both and .
In fact, when and , we prove that every graph with fractional arboricity decomposes into two forests such that has maximum degree , every component of has at most one vertex of degree , further if a component of has a vertex of degree then it has at most edges, and otherwise a component of has at most edges.
Shifting focus to problems which partition the vertex set, circular colouring provides a way to fractionally refine colouring problems. A classic theorem of Tuza says that every graph with no cycles of length is -colourable. Generalizing this to circular colouring, we get the following:
Let and be relatively prime, with , and let be the element of such that . Let be an edge in a graph . If is -circular-colorable and is not, then lies in at least one
cycle in of length congruent to for some in
. If this does not occur with , then lies in at least two cycles of length and contains a cycle of length .
This theorem is best possible with regards to the number of congruence classes when .
A classic theorem of Gr\"{o}tzsch says that triangle free planar graphs are -colourable. There are many generalizations of this result, however fitting the theme of fractional refinements, Jaeger conjectured that every planar graph of girth admits a homomorphism to . While we make no progress on this conjecture directly, one way to approach the conjecture is to prove critical graphs have large average degree. On this front, we prove:
Every -critical graph which does not have a -colouring and is not or satisfies , and
every triangle free -critical graph satisfies .
In the case of the second theorem, a result of Davies shows there exists infinitely many triangle free -critical graphs satisfying , and hence the second theorem is close to being tight. It also generalizes results of Thomas and Walls, and also Thomassen, that girth graphs embeddable on the torus, projective plane, or Klein bottle are -colourable.
Lastly, a theorem of Cereceda, Johnson, and van den Heuvel, says that given a -connected bipartite planar graph with no separating four-cycles and a -colouring , then one can obtain all -colourings from by changing one vertices' colour at a time if and only if has at most one face of size .
We give the natural generalization of this to circular colourings when
- …