Results 11 to 20 of about 40 (25)
Structural Results for General Partition, Equistable and Triangle graphs
Abstract Miklavic and Milanic (2011) introduced the connections among the classes of equistable, general partition and triangle graphs. We present results concerning the three classes aforementioned. In particular, we show that the general partition and triangle classes are both closed under the operations of substitution, induction and contraction ...
Márcia R. Cerioli, Taísa L. Martins
exaly +2 more sources
Strong cliques and equistability of EPT graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liliana Alcon +2 more
exaly +4 more sources
Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs [PDF]
AbstractEquistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight 1. Strongly equistable graphs are graphs such that for every and every nonempty subset T of vertices that is not a maximal stable set, there exist positive vertex weights assigning ...
Milanič, Martin, Trotignon, Nicolas
openaire +3 more sources
Entropy-enthalpy transduction caused by conformational shifts can obscure the forces driving protein-ligand binding. [PDF]
Fenley AT, Muddana HS, Gilson MK.
europepmc +1 more source
Counterexamples to three conjectures on equistable graphs
Milanič, Martin, Trotignon, Nicolas
openaire +1 more source
Equistable graphs: conjectures, results, and connections with Boolean functions
Milanič, Martin +5 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Short proofs on the structure of general partition, equistable and triangle graphs
Discrete Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taisa Lopes Martins
exaly +3 more sources
Journal of Graph Theory, 1994
AbstractAn equistable graph is a graph for which the incidence vectors of the maximal stable sets are the 0–1 solutions of a linear equation. A necessary condition and a sufficient condition for equistability are given. They are used to characterize the equistability of various classes of perfect graphs, outerplanar graphs, and pseudothreshold graphs ...
Nadimpalli V. R. Mahadev +2 more
exaly +3 more sources
AbstractAn equistable graph is a graph for which the incidence vectors of the maximal stable sets are the 0–1 solutions of a linear equation. A necessary condition and a sufficient condition for equistability are given. They are used to characterize the equistability of various classes of perfect graphs, outerplanar graphs, and pseudothreshold graphs ...
Nadimpalli V. R. Mahadev +2 more
exaly +3 more sources

