[图书][B] Basic graph theory
MS Rahman - 2017 - Springer
This book is written based on my class notes developed while teaching the undergraduate
graph theory course “Basic Graph Theory” at the Department of Computer Science and …
graph theory course “Basic Graph Theory” at the Department of Computer Science and …
Pairwise compatibility graphs: A survey
T Calamoneri, B Sinaimeri - siam REVIEW, 2016 - SIAM
A graph G=(V,E) is a pairwise compatibility graph (PCG) if there exists an edge-weighted
tree T and two nonnegative real numbers d_min and d_max such that each leaf u of T is a …
tree T and two nonnegative real numbers d_min and d_max such that each leaf u of T is a …
A survey on pairwise compatibility graphs
Let T be an edge weighted tree and dmin, dmax be two non-negative real numbers where d
min≤ d max. The pairwise compatibility graph (PCG) of T for dmin, dmax is a graph G such …
min≤ d max. The pairwise compatibility graph (PCG) of T for dmin, dmax is a graph G such …
Pairwise compatibility graphs of caterpillars
T Calamoneri, A Frangioni… - The Computer Journal, 2014 - ieeexplore.ieee.org
A graph G=(V, E) is called a pairwise compatibility graph (PCG) if there exists an edge-
weighted tree T and two non-negative real numbers d min and d max such that each leaf lu …
weighted tree T and two non-negative real numbers d min and d max such that each leaf lu …
Characterizing star-PCGs
M Xiao, H Nagamochi - Algorithmica, 2020 - Springer
A graph G is called a pairwise compatibility graph (PCG, for short) if it admits a tuple (T, w,
d_\min, d_\max)(T, w, d min, d max) of a tree T whose leaf set is equal to the vertex set of G …
d_\min, d_\max)(T, w, d min, d max) of a tree T whose leaf set is equal to the vertex set of G …
Inferring phylogenetic trees from the knowledge of rare evolutionary events
Rare events have played an increasing role in molecular phylogenetics as potentially
homoplasy-poor characters. In this contribution we analyze the phylogenetic information …
homoplasy-poor characters. In this contribution we analyze the phylogenetic information …
Pairwise compatibility graphs revisited
A graph G=(V, E) is called a pairwise compatibility graph (PCG) if there exists an edge-
weighted tree T and two non-negative real numbers d min and d max such that each leaf lu …
weighted tree T and two non-negative real numbers d min and d max such that each leaf lu …
Multi-interval pairwise compatibility graphs
Let T be an edge weighted tree and let d_ min, d_ max be two non-negative real numbers
where d_ min ≤ d_ max. A pairwise compatibility graph (PCG) of T for d_ min, d_ max is a …
where d_ min ≤ d_ max. A pairwise compatibility graph (PCG) of T for d_ min, d_ max is a …
A necessary condition and a sufficient condition for pairwise compatibility graphs
In this paper we give a necessary condition and a sufficient condition for a graph to be a
pairwise compatibility graph (PCG). Let G be a graph and let G^ c G c be the complement of …
pairwise compatibility graph (PCG). Let G be a graph and let G^ c G c be the complement of …
A method for enumerating pairwise compatibility graphs with a given number of vertices
NA Azam, A Shurbevski, H Nagamochi - Discrete Applied Mathematics, 2021 - Elsevier
Abstract Azam et al.(2018) proposed a method to enumerate all pairwise compatibility
graphs (PCGs) with a given number n of vertices. For a tuple (G, T, σ, λ) of a graph G with n …
graphs (PCGs) with a given number n of vertices. For a tuple (G, T, σ, λ) of a graph G with n …