Matching graphs
Linda Eroh,Michelle Schultz +1 more
- 01 Oct 1998
Vol. 29, Iss: 2, pp 73-86
11
TL;DR: In this paper, the authors studied the behavior of sequences of iterated matching graphs and showed that even cycles can be added to the list of known matching graphs, which is not known in general.
read more
Abstract: The matching graph M(G) of a graph G is that graph whose vertices are the maximum matchings in G and where two vertices M1 and M2 of M(G) are adjacent if and only if |M1 - M2| = 1. When M(G) is connected, this graph models a metric space whose metric is defined on the set of maximum matchings in G. Which graphs are matching graphs of some graph is not known in general. We determine several forbidden induced subgraphs of matching graphs and add even cycles to the list of known matching graphs. In another direction, we study the behavior of sequences of iterated matching graphs. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 73–86, 1998
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Behavioral matchmaking for service retrieval
Daniela Grigori,Juan Carlos Corrales,Mokrane Bouzeghoub +2 more
- 18 Sep 2006
TL;DR: This paper argues that, in many situations, the service discovery should be based on the specification of service behavior (in particular, the conversation protocol), and develops matching techniques that operate on behavior models and allow delivery of partial matches and evaluation of semantic distance between these matches and the user requirements.
Resonance graphs of catacondensed even ring systems are median
TL;DR: For a class of graphs containing the chemically important catacondensed benzenoid graphs the authors show that the resonance graphs are median, and if G belongs to this class, R(G) has an isometric embedding into Qf, where f is the number of bounded faces of G.
35
Modelling social network evolution
Radosław Michalski,Sebastian Palus,Piotr Bródka,Przemysław Kazienko,Krzysztof Juszczyszyn +4 more
- 06 Oct 2011
TL;DR: The model presented in the paper focuses on definition of differences between following network snapshots by means of Graph Differential Tuple.
12
Quantifying Social Network Dynamics
TL;DR: The following paper focuses on the definition of differences between network snapshots by means of Graph Differential Tuple that enable to calculate the diverse distance measures as well as to investigate the speed of changes.
7
Quantifying social network dynamics
Radosław Michalski,Piotr Bródka,Przemysław Kazienko,Krzysztof Juszczyszyn +3 more
- 01 Nov 2012
TL;DR: In this article, the authors focus on the definition of differences between network snapshots by means of Graph Differential Tuple, which enable to calculate the diverse distance measures as well as to investigate the speed of changes.
4
References
A note concerning paths and independence number in digraphs
Gena Hahn,Bill Jackson +1 more
TL;DR: It is shown that there exist digraphs D such that for all paths P 1 and P 2 the authors have α(D ( P 1 ∪ P 2 )) = α( D ) and point to a generalization.
6