Sciweavers

4201 search results - page 36 / 841
» Interaction graphs: Additives
Sort
View
140
Voted
BIRTHDAY
2008
Springer
15 years 5 months ago
Linear Recurrence Relations for Graph Polynomials
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...
Eldar Fischer, Johann A. Makowsky
128
Voted
COLOGNETWENTE
2009
15 years 4 months ago
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
: 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...
Stavros D. Nikolopoulos, Charis Papadopoulos
110
Voted
AMC
2008
78views more  AMC 2008»
15 years 3 months ago
Information processing in complex networks: Graph entropy and information functionals
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...
Matthias Dehmer
139
Voted
JGT
2008
91views more  JGT 2008»
15 years 3 months ago
On the editing distance of graphs
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...
Maria Axenovich, André E. Kézdy, Rya...