ترغب بنشر مسار تعليمي؟ اضغط هنا

On relative clique number of colored mixed graphs

96   0   0.0 ( 0 )
 نشر من قبل Soumen Nandi Dr.
 تاريخ النشر 2018
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

An $(m, n)$-colored mixed graph is a graph having arcs of $m$ different colors and edges of $n$ different colors. A graph homomorphism of an $(m, n$)-colored mixed graph $G$ to an $(m, n)$-colored mixed graph $H$ is a vertex mapping such that if $uv$ is an arc (edge) of color $c$ in $G$, then $f(u)f(v)$ is also an arc (edge) of color $c$. The ($m, n)$-colored mixed chromatic number of an $(m, n)$-colored mixed graph $G$, introduced by Nev{s}etv{r}il and Raspaud [J. Combin. Theory Ser. B 2000] is the order (number of vertices) of the smallest homomorphic image of $G$. Later Bensmail, Duffy and Sen [Graphs Combin. 2017] introduced another parameter related to the $(m, n)$-colored mixed chromatic number, namely, the $(m, n)$-relative clique number as the maximum cardinality of a vertex subset which, pairwise, must have distinct images with respect to any colored homomorphism. In this article, we study the $(m, n$)-relative clique number for the family of subcubic graphs, graphs with maximum degree $Delta$, planar graphs and triangle-free planar graphs and provide new improved bounds in each of the cases. In particular, for subcubic graphs we provide exact value of the parameter.



قيم البحث

اقرأ أيضاً

Clique-width is a complexity measure of directed as well as undirected graphs. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and structural properties. It is in particular related to the vertex-minor re lation. We discuss an extension of the notion of rank-width to edge-colored graphs. A C-colored graph is a graph where the arcs are colored with colors from the set C. There is not a natural notion of rank-width for C-colored graphs. We define two notions of rank-width for them, both based on a coding of C-colored graphs by edge-colored graphs where each edge has exactly one color from a field F and named respectively F-rank-width and F-bi-rank-width. The two notions are equivalent to clique-width. We then present a notion of vertex-minor for F-colored graphs and prove that F-colored graphs of bounded F-rank-width are characterised by a finite list of F-colored graphs to exclude as vertex-minors. A cubic-time algorithm to decide whether a F-colored graph has F-rank-width (resp. F-bi-rank-width) at most k, for fixed k, is also given. Graph operations to check MSOL-definable properties on F-colored graphs of bounded rank-width are presented. A specialisation of all these notions to (directed) graphs without edge colors is presented, which shows that our results generalise the ones in undirected graphs.
We give an $O(n^4)$ algorithm to find a minimum clique cover of a (bull, $C_4$)-free graph, or equivalently, a minimum colouring of a (bull, $2K_2$)-free graph, where $n$ is the number of vertices of the graphs.
The objective of the well-known Towers of Hanoi puzzle is to move a set of disks one at a time from one of a set of pegs to another, while keeping the disks sorted on each peg. We propose an adversarial variation in which the first player forbids a s et of states in the puzzle, and the second player must then convert one randomly-selected state to another without passing through forbidden states. Analyzing this version raises the question of the treewidth of Hanoi graphs. We find this number exactly for three-peg puzzles and provide nearly-tight asymptotic bounds for larger numbers of pegs.
Bir{o} et al. (1992) introduced $H$-graphs, intersection graphs of connected subgraphs of a subdivision of a graph $H$. They are related to many classes of geometric intersection graphs, e.g., interval graphs, circular-arc graphs, split graphs, and c hordal graphs. We negatively answer the 25-year-old question of Bir{o} et al. which asks if $H$-graphs can be recognized in polynomial time, for a fixed graph $H$. We prove that it is NP-complete if $H$ contains the diamond graph as a minor. We provide a polynomial-time algorithm recognizing $T$-graphs, for each fixed tree $T$. When $T$ is a star $S_d$ of degree $d$, we have an $O(n^{3.5})$-time algorithm. We give FPT- and XP-time algorithms solving the minimum dominating set problem on $S_d$-graphs and $H$-graphs parametrized by $d$ and the size of $H$, respectively. The algorithm for $H$-graphs adapts to an XP-time algorithm for the independent set and the independent dominating set problems on $H$-graphs. If $H$ contains the double-triangle as a minor, we prove that $H$-graphs are GI-complete and that the clique problem is APX-hard. The clique problem can be solved in polynomial time if $H$ is a cactus graph. When a graph $G$ has a Helly $H$-representation, the clique problem can be solved in polynomial time. We show that both the $k$-clique and the list $k$-coloring problems are solvable in FPT-time on $H$-graphs (parameterized by $k$ and the treewidth of $H$). In fact, these results apply to classes of graphs with treewidth bounded by a function of the clique number. We observe that $H$-graphs have at most $n^{O(|H|)}$ minimal separators which allows us to apply the meta-algorithmic framework of Fomin et al. (2015) to show that for each fixed $t$, finding a maximum induced subgraph of treewidth $t$ can be done in polynomial time. When $H$ is a cactus, we improve the bound to $O(|H|n^2)$.
Multiple interval graphs are variants of interval graphs where instead of a single interval, each vertex is assigned a set of intervals on the real line. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple interval gr aphs. The MAXIMUM CLIQUE problem, or the problem of finding the size of the maximum clique, is known to be NP-complete for $t$-interval graphs when $tgeq 3$ and polynomial-time solvable when $t=1$. The problem is also known to be NP-complete in $t$-track graphs when $tgeq 4$ and polynomial-time solvable when $tleq 2$. We show that MAXIMUM CLIQUE is already NP-complete for unit 2-interval graphs and unit 3-track graphs. Further, we show that the problem is APX-complete for 2-interval graphs, 3-track graphs, unit 3-interval graphs and unit 4-track graphs. We also introduce two new classes of graphs called $t$-circular interval graphs and $t$-circular track graphs and study the complexity of the MAXIMUM CLIQUE problem in them. On the positive side, we present a polynomial time $t$-approximation algorithm for WEIGHTED MAXIMUM CLIQUE on $t$-interval graphs, improving earlier work with approximation ratio $4t$.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا