Add to ORKGLet <i>G</i> = (<i>V, E</i>) be a graph. A subset <i>S</i> of <i>V</i> is called an <i>equivalence set</i> if every component of the induced subgraph <<i>S</i> is complete. In this paper starting with the concept of equivalence set as seed property, we form an inequality chain of six parameters, which we call the <i>equivalence chain</i> of <i>G</i>. WE present several basic results on these parameters and problems for further investigation
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983...
We generalize the well-known correspondence between partitions and equivalence relations on a set to...
AbstractTo determine if two lists of numbers are the same set, we sort both lists and see if we get ...
Let G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the ind...
Let G = (V, E) be a graph. A subset S of V is called an equivalence set if every component of the in...
Let G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the ind...
Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex se...
For a graph G = (V, E), a subset S ⊆ V (G) is an equivalence dominating set if for every vertex v ∈ ...
AbstractLet G be the set of finite graphs whose vertices belong to some fixed countable set, and let...
An equivalence structure (X, E) is a set E of equivalence relations on a set X such that any two dis...
Graduation date: 1963This thesis treats the problem of enumerating equivalence\ud classes of Euler p...
AbstractAn equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a g...
AbstractThe following inequality chain has been extensively studied in the discrete mathematical lit...
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983...
Click on the link to view the abstract.Keywords: Equivalence domination, total domination, P3-formin...
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983...
We generalize the well-known correspondence between partitions and equivalence relations on a set to...
AbstractTo determine if two lists of numbers are the same set, we sort both lists and see if we get ...
Let G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the ind...
Let G = (V, E) be a graph. A subset S of V is called an equivalence set if every component of the in...
Let G = (V,E) be a graph. A subset S of V is called an equivalence set if every component of the ind...
Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex se...
For a graph G = (V, E), a subset S ⊆ V (G) is an equivalence dominating set if for every vertex v ∈ ...
AbstractLet G be the set of finite graphs whose vertices belong to some fixed countable set, and let...
An equivalence structure (X, E) is a set E of equivalence relations on a set X such that any two dis...
Graduation date: 1963This thesis treats the problem of enumerating equivalence\ud classes of Euler p...
AbstractAn equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a g...
AbstractThe following inequality chain has been extensively studied in the discrete mathematical lit...
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983...
Click on the link to view the abstract.Keywords: Equivalence domination, total domination, P3-formin...
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983...
We generalize the well-known correspondence between partitions and equivalence relations on a set to...
AbstractTo determine if two lists of numbers are the same set, we sort both lists and see if we get ...