Results 11 to 20 of about 3,337,855 (342)
viXra, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +3 more sources
ACM Computing Surveys, 2021 In this article, we provide a comprehensive introduction to knowledge graphs, which have recently garnered significant attention from both industry and academia in scenarios that require exploiting diverse, dynamic, large-scale collections of data.
Aidan Hogan +17 more
openaire +17 more sources
Interaction graphs: Graphings [PDF]
Annals of Pure and Applied Logic, 2017 In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures - graphs - than Girard's constructions, while generalizing the latter since they can be recovered as special cases of
Thomas Seiller, Thomas Seiller
openaire +3 more sources
Graphs Cospectral with Kneser Graphs [PDF]
SSRN Electronic Journal, 2009 AMS Subject Classification ...
Haemers, W.H., Ramezani, F.
openaire +6 more sources
, 2023 We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are sets of graphs that are defined by forbidding finitely many local patterns. In this paper, we focus on the question
Arrighi, Pablo +2 more
openaire +4 more sources
Artificial Intelligence, 2017 Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding ...
Endriss, Ulle, Grandi, Umberto
openaire +10 more sources
String graphs and incomparability graphs [PDF]
Proceedings of the twenty-eighth annual symposium on Computational geometry, 2012 Given a collection C of curves in the plane, its string graph is defined as the graph with vertex set C, in which two curves in C are adjacent if and only if they intersect. Given a partially ordered set (P,
Fox, Jacob, Pach, János
openaire +5 more sources
, 2021 Constructing new graph from the graph's parameters and related notions in the way that, the study on the new graph and old graph in their parameters could be facilitated. As graph, new graph has some characteristics and results which are related to the structure of this graph.
openaire +2 more sources
Planar Graphs as VPG-Graphs [PDF]
Journal of Graph Algorithms and Applications, 2013 A graph is Bk-VPG when it has an intersection representation by paths in a rectangular grid with at most k bends (turns). It is known that all planar graphs are B3-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are B2-VPG.
Steven Chaplick, Torsten Ueckerdt
openaire +4 more sources
On the independence graph of a graph
Discrete Mathematics, 2003 AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two vertices being adjacent whenever the corresponding sets are disjoint. Vizing's inequality involving the independence number of the Cartesian product of graphs G and H states that α(G□H)⩽min{α(G)|V(H)|,α(H)|V(G)|}.
Bla Zmazek, Boštjan Brešar
openaire +1 more source