Results 1 to 10 of about 2,359,032 (19)
Graph Homomorphism Revisited for Graph Matching [PDF]
, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another G p , i.e. , whether G
Fan, Wenfei +4 more
core +1 more source
Smith forms for adjacency matrices of circulant graphs [PDF]
, 2014 We calculate the Smith normal form of the adjacency matrix of each of the following graphs or their complements (or both): complete graph, cycle graph, square of the cycle, power graph of the cycle, distance matrix graph of cycle, Andrásfai graph, Doob ...
Williams, Gerald
core +1 more source
, 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 +1 more source
, 2013 In this paper, we propose a rigorous way to define the concept of ambiguity in the domain of graphs. In past studies, the classical definition of ambiguity has been derived starting from fuzzy set and fuzzy information theories.
LIVI, LORENZO, RIZZI, Antonello
core +1 more source
A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
, 2020 We introduce MSO graph storage types, and call a storage type MSO-expressible if it is isomorphic to some MSO graph storage type. An MSO graph storage type has MSO-definable sets of graphs as storage configurations and as storage transformations.
Engelfriet, Joost, Vogler, Heiko
core +1 more source
Generalized characteristic polynomials of graph bundles [PDF]
, 2007 In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic polynomial of the graph.
Bartholdi +16 more
core +2 more sources
Integration and measures on the space of countable labelled graphs [PDF]
, 2015 In this paper we develop a rigorous foundation for the study of integration and measures on the space $\mathscr{G}(V)$ of all graphs defined on a countable labelled vertex set $V$.
Khare, Apoorva, Rajaratnam, Bala
core
Graph properties of graph associahedra [PDF]
, 2015 A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their diameter and ...
Manneville, Thibault, Pilaud, Vincent
core +1 more source
Graph Abstraction and Abstract Graph Transformation [PDF]
, 2007 Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness.
Bauer, J. +3 more
core +1 more source
Graph properties, graph limits and entropy [PDF]
, 2013 We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number, which by well ...
Hatami, Hamed +2 more
core +1 more source