4201 search results - page 36 / 841 » Interaction graphs: Additives |
CGVR
2010
14 years 9 months ago
2010
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
COLOGNETWENTE
2009
15 years 25 days ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
AMC
2008
14 years 12 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
103
click to vote
JGT
2008
14 years 11 months ago
2008
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...