43 research outputs found
List coloring in the absence of a linear forest.
The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. The Listk-Coloring problem requires in addition that every vertex u must receive a color from some given set L(u)â{1,âŠ,k}. Let Pn denote the path on n vertices, and G+H and rH the disjoint union of two graphs G and H and r copies of H, respectively. For any two fixed integers k and r, we show that Listk-Coloring can be solved in polynomial time for graphs with no induced rP1+P5, hereby extending the result of HoĂ ng, KamiĆski, Lozin, Sawada and Shu for graphs with no induced P5. Our result is tight; we prove that for any graph H that is a supergraph of P1+P5 with at least 5 edges, already List 5-Coloring is NP-complete for graphs with no induced H
Variations on Graph Products and Vertex Partitions
In this thesis we investigate two graph products called double vertex graphs and complete double vertex graphs, and two vertex partitions called dominator partitions and rankings. We introduce a new graph product called the complete double vertex graph and study its properties. The complete double vertex graph is a natural extension of the Cartesian product and a generalization of the double vertex graph. We establish many properties of complete double vertex graphs, including results involving the chromatic number of a complete double vertex graph and the characterization of planar complete double vertex graphs. We also investigate the important problem of reconstructing the factors of double vertex graphs and complete double vertex graphs. We reconstruct G from double vertex graphs and complete double vertex graphs for different classes of graphs, including cubic graphs. Next, we look at the properties of dominator partitions of graphs. We characterize minimal dominator partitions of a graph G. This helps us to study the properties of the upper dominator partition number and establish bounds on the upper dominator partition number of different families of graphs, including trees. We also calculate the upper dominator partition number of certain classes of graphs, including paths and cycles, which is surprisingly difficult to calculate. Properties of rankings are studied in this thesis as well. We establish more properties of minimal rankings, including results related to permuting the labels of certain minimal rankings of a graph G. In addition, we investigate rankings of the Cartesian product of two complete graphs, also known as the rook\u27s graph. We establish bounds on the rank number of a rook\u27s graph and calculate its arank number using multiple results we obtain on minimal rankings of a rook\u27s graph
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
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
Total Global Dominator Coloring of Trees and Unicyclic Graphs
         A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does not dominate another color class. The minimum number of colors required in such a coloring of  is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored
International Journal of Mathematical Combinatorics, Vol.6A
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandache multi-spaces, Smarandache geometries, mathematical combinatorics, non-euclidean geometry and topology and their applications to other sciences
-Parking Functions, Acyclic Orientations and Spanning Trees
Given an undirected graph , and a designated vertex , the
notion of a -parking function (with respect to ) was independently
developed and studied by various authors, and has recently gained renewed
attention. This notion generalizes the classical notion of a parking function
associated with the complete graph. In this work, we study properties of {\em
maximum} -parking functions and provide a new bijection between them and the
set of spanning trees of with no broken circuit. As a case study, we
specialize some of our results to the graph corresponding to the discrete
-cube . We present the article in an expository self-contained form,
since we found the combinatorial aspects of -parking functions somewhat
scattered in the literature, typically treated in conjunction with sandpile
models and closely related chip-firing games.Comment: Added coauthor, extension of v2 with additional results and
references. 28 pages, 2 figure
Routing in Histograms
Let be an -monotone orthogonal polygon with vertices. We call
a simple histogram if its upper boundary is a single edge; and a double
histogram if it has a horizontal chord from the left boundary to the right
boundary. Two points and in are co-visible if and only if the
(axis-parallel) rectangle spanned by and completely lies in . In the
-visibility graph of , we connect two vertices of with an edge
if and only if they are co-visible.
We consider routing with preprocessing in . We may preprocess to
obtain a label and a routing table for each vertex of . Then, we must be
able to route a packet between any two vertices and of , where each
step may use only the label of the target node , the routing table and
neighborhood of the current node, and the packet header.
We present a routing scheme for double histograms that sends any data packet
along a path whose length is at most twice the (unweighted) shortest path
distance between the endpoints. In our scheme, the labels, routing tables, and
headers need bits. For the case of simple histograms, we obtain a
routing scheme with optimal routing paths, -bit labels, one-bit
routing tables, and no headers.Comment: 18 pages, 11 figure