Jump number of dags having Dilworth number 2
نویسندگان
چکیده
منابع مشابه
On pairwise compatibility graphs having Dilworth number two
A graph G = (V, E) is called a pairwise compatibility graph (PCG) if there exists a tree T , a positive edge-weight function w on T , and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that V coincides with the set of leaves of T , and there is an edge (u, v) ∈ E if and only if dmin ≤ dT,w(u, v) ≤ dmax where dT,w(u, v) is the sum of the weights of the edges on the unique path fr...
متن کاملCorrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]
In [4] we put in relation graphs with Dilworth number at most two and the two classes LPG and mLPG. In order to prove this relation, we have heavily exploited a result we deduced from [1]. We have now realized that this result is not always true, so in this corrigendum we correctly restate the result concerning the relation between graphs with Dilworth number at most two and the two classes of ...
متن کاملThe Dilworth Number of Auto-Chordal-Bipartite Graphs
The mirror (or bipartite complement) mir(B) of a bipartite graph B = (X,Y,E) has the same color classes X and Y as B, and two vertices x ∈ X and y ∈ Y are adjacent in mir(B) if and only if xy / ∈ E. A bipartite graph is chordal bipartite if none of its induced subgraphs is a chordless cycle with at least six vertices. In this paper, we deal with chordal bipartite graphs whose mirror is chordal ...
متن کاملEdge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90002-7