Search results for "Clique"
showing 10 items of 28 documents
Nitric oxide signalling in plants: interplays with Ca2+ and protein kinase
2008
International audience; Much attention has been paid to nitric oxide (NO)research since its discovery as a physiological mediator of plant defence responses. In recent years, newer roles have been attributed to NO, ranging from root development to stomatal closure. The molecular mechanisms underlying NO action in plants are just begun to emerge. The currently available data illustrate that NO can directly influence the activity of target proteins through nitrosylation and has the capacity to act as a Ca2+-mobilizing intracellular messenger. The interplay between NO and Ca2+ has important functional implications, expanding and enriching the possibilities for modulating transduction processes…
A branch-and-price framework for decomposing graphs into relaxed cliques
2021
We study the family of problems of partitioning and covering a graph into/with a minimum number of relaxed cliques. Relaxed cliques are subsets of vertices of a graph for which a clique-defining property—for example, the degree of the vertices, the distance between the vertices, the density of the edges, or the connectivity between the vertices—is relaxed. These graph partitioning and covering problems have important applications in many areas such as social network analysis, biology, and disease-spread prevention. We propose a unified framework based on branch-and-price techniques to compute optimal decompositions. For this purpose, new, effective pricing algorithms are developed, and new…
Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs
2009
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.
Maximum weight relaxed cliques and Russian Doll Search revisited
2015
Trukhanov et al. [Trukhanov S, Balasubramaniam C, Balasundaram B, Butenko S (2013) Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comp. Opt. and Appl., 56(1), 113–130] used the Russian Doll Search (RDS) principle to effectively find maximum hereditary structures in graphs. Prominent examples of such hereditary structures are cliques and some clique relaxations intensely discussed and studied in network analysis. The effectiveness of the tailored RDS by Trukhanov et al. for s-plex and s-defective clique can be attributed to their cleverly designed incremental verification procedures used to distinguish feasible from infeasible struct…
On the chromatic number of disk graphs
1998
Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their different generalizations. For all these graphs including the most general class of the double disk (DD) graphs, it is shown that X(G) ≤ c.ω(G) for a constant c. Several coloring algorithms are analyzed for disk graphs, aiming to improve the bounds on X(G). We find that their worst-case performance expressed in the number of used colors is indeed reached in some instances.
Complexes de métaux de transition avec des ligands carbènes N-hétérocycliques : synthèses et réactivité
2015
The purpose of this work is the synthesis of complexes containing imine-functionalized protic NHC ligands in order to further develop synthetic methodologies giving access to pNHC, C-bound ‘anionic’ imidazolide, and homo- and heterodinuclear complexes. In the case of imidazoles without functional group, deprotonation with n-butyl lithium afforded (1-aryl-1H-imidazol-2-yl)lithium in good yield. Reaction of (1-aryl-1H-imidazol-2-yl)lithium with [Ir(cod)(μ-Cl)]2 or [Rh(cod)(μ-Cl)]2 yielded a doubly C2,N3-bridged dinuclear complex. In the case of imine-functionalized imidazole, the Ir(I) N-bound imidazole complex can tautomerize to Ir(I) imine-functionalized pNHC complex chloride abstraction at…
Synthèse de ligands macrocycliques comportant des fragments aromatiques et leur application pour la détection des cations métalliques
2011
The PhD thesis deals with the synthesis of polyazaligands using Pd-catalyzed amination of aryl halides. The manuscript consists of two parts. In the first part the scope of the Pd-catalyzed amination reaction for the synthesis of polyazamacrocyclic ligands is studied. The Pd-catalyzed amination of 2,7-dibromonaphthalene, 3,3’-dibromobiphenyl and 6,6’-dibromo-2,2’-bipyridyl with linear polyamines and oxadiamines is thoroughly investigated, and corresponding nitrogen- and oxygen-containing macrocycles is synthesized in yields up to 45%. The dependence of the formation of macrocycles and cyclic oligomers on the nature of the starting compounds is established. Two alternative approaches to cycl…
How Do Efforts to Enhance Career Preparation Affect Peer Groups?
2010
The present study investigated how efforts to enhance career preparation affect peer groups. The participants were 710 9th graders who were randomized into control and intervention groups and assessed 3 times during 1 academic year: at baseline (T1, Fall), immediately after the career preparation intervention (T2, 3 months after baseline), and 5 months after the intervention (T3, Spring). The results showed, first, that maintenance of a stable clique was more likely when most clique members participated in the intervention. Second, it was found that the members of adolescents' cliques resembled each other in respect of the strength of the intervention effect. Finally, the results showed tha…
Potential approach in marginalizing Gibbs models
1999
Abstract Given an undirected graph G or hypergraph potential H model for a given set of variables V , we introduce two marginalization operators for obtaining the undirected graph G A or hypergraph H A associated with a given subset A ⊂ V such that the marginal distribution of A factorizes according to G A or H A , respectively. Finally, we illustrate the method by its application to some practical examples. With them we show that potential approach allow defining a finer factorization or performing a more precise conditional independence analysis than undirected graph models. Finally, we explain connections with related works.
Some properties of vertex-oblique graphs
2016
The type t G ( v ) of a vertex v ? V ( G ) is the ordered degree-sequence ( d 1 , ? , d d G ( v ) ) of the vertices adjacent with v , where d 1 ? ? ? d d G ( v ) . A graph G is called vertex-oblique if it contains no two vertices of the same type. In this paper we show that for reals a , b the class of vertex-oblique graphs G for which | E ( G ) | ? a | V ( G ) | + b holds is finite when a ? 1 and infinite when a ? 2 . Apart from one missing interval, it solves the following problem posed by Schreyer et?al. (2007): How many graphs of bounded average degree are vertex-oblique? Furthermore we obtain the tight upper bound on the independence and clique numbers of vertex-oblique graphs as a fun…