Buscar
Mostrando ítems 1-10 de 1366
Covergence and divergence of the iterated biclique graph
(Wiley, 2013-06)
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. The biclique graph of G, denoted by KB(G), is the intersection graph of the bicliques of G. We say that a graph G diverges (or converges or is ...
Recognizing clique graphs of directed edge path graphs
(Elsevier Science BvAmsterdamHolanda, 2003)
A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps
(2009)
Strategic options development and analysis (SODA) has maintained that it expects a links-to-concepts ratio of 1.15-1.20 in cognitive maps. This expectation is investigated from a graph-theoretic perspective in order to ...
Path on graphs and associated quantum groupoids
(Unión Matemática Argentina, 2010-09)
Given any simple biorientable graph it is shown that there exists a weak *-Hopf algebra constructed on the vector space of graded endomorphisms of essential paths on the graph. This construction is based on a direct sum ...
Biclique graphs and biclique matrices
(John Wiley & Sons Inc, 2010-01)
A biclique of a graph G is a maximal induced complete bipar tite subgraph of G. Given a graph G, the biclique matrix of G is a {0,1, -1} matrix having one row for each biclique and one column for each vertex of G, and such ...