Buscar
Mostrando ítems 1-10 de 346
Clique-perfectness of complements of line graphs
(Elsevier, 2015)
A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques
equals the minimum number of vertices intersecting all maximal cliques for each induced
subgraph. In this work, we give necessary and ...
Graphs with independent perfect matchings
(John Wiley & Sons IncHobokenEUA, 2005)
Matching signatures and Pfaffian graphs
(Elsevier Science BvAmsterdamHolanda, 2011)
The determinant of matching matrix in the evaluation of matching polynomialThe determinant of matching matrix in the evaluation of matching polynomial
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2002)
Structural matching of 2D electrophoresis gels using deformed graphs
(ELSEVIER SCIENCE BV, 2011)
2D electrophoresis is a well-known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation and the goal is to perform a differential ...
Clique-perfectness of complements of line graphs
(Elsevier Science, 2015-05)
A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques equals the minimum number of vertices intersecting all maximal cliques for each induced subgraph. In this work, we give necessary and ...
Exact Algorithms for Minimum Weighted Dominating Induced Matching
(Springer, 2017-03)
Say that an edge of a graph G dominates itself and every other edge sharing a vertex of it. An edge dominating set of a graph G= (V, E) is a subset of edges E′⊆ E which dominates all edges of G. In particular, if every ...
Strong cliques and equistability of EPT graphs
(Elsevier Science, 2016-04)
In this paper, we characterize the equistable graphs within the class of EPT graphs, the edge-intersection graphs of paths in a tree. This result generalizes a previously known characterization of equistable line graphs. ...
How to build a brick
(Elsevier Science BvAmsterdamHolanda, 2006)
Foundations of modern query languages for graph databases
(Association for Computing Machinery, 2017)
We survey foundational features underlying modern graph query languages. We first discuss two popular graph data models: edge-labelled graphs, where nodes are connected by directed, labelled edges, and property graphs, ...