AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivial connected cartesian products and show that all such products are semi-stable. Further we show that except for certain (listed) restricted graphs, connected cartesian products are semi-stable at every vertex. Finally, we show that the cartesian product of any two graphs is not semi-stable if and only if one of them is totally disconnected and the other is not semi-stable
AbstractA graph G is retract rigid if any retract of itself is isomorphic to G. The Cartesian produc...
We show that non-domination results for targets that are not dominated by products are stable under ...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivia...
AbstractIn this paper we prove that the cartesian product of two trees is a semistable graph and we ...
AbstractWe study the generating functions for the number of stable sets of all cardinalities, in the...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
The main aim of this paper is to establish conditions that are necessary and sufficient for the edge...
We study path-pairability of Cartesian product of graphs and prove that the Cartesian product of the...
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with a...
AbstractUse vi,κi,λi,δi to denote order, connectivity, edge-connectivity and minimum degree of a gra...
We study linkedness of the Cartesian product of graphs and prove that the product of an a-linked and...
In this paper, we investigate a problem of finding natural condition to assure the product of two gr...
AbstractIn this paper we give a necessary and sufficient condition for the generalized Cartesian pro...
AbstractIn this paper, we study containment properties of graphs in relation with the Cartesian prod...
AbstractA graph G is retract rigid if any retract of itself is isomorphic to G. The Cartesian produc...
We show that non-domination results for targets that are not dominated by products are stable under ...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivia...
AbstractIn this paper we prove that the cartesian product of two trees is a semistable graph and we ...
AbstractWe study the generating functions for the number of stable sets of all cardinalities, in the...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
The main aim of this paper is to establish conditions that are necessary and sufficient for the edge...
We study path-pairability of Cartesian product of graphs and prove that the Cartesian product of the...
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with a...
AbstractUse vi,κi,λi,δi to denote order, connectivity, edge-connectivity and minimum degree of a gra...
We study linkedness of the Cartesian product of graphs and prove that the product of an a-linked and...
In this paper, we investigate a problem of finding natural condition to assure the product of two gr...
AbstractIn this paper we give a necessary and sufficient condition for the generalized Cartesian pro...
AbstractIn this paper, we study containment properties of graphs in relation with the Cartesian prod...
AbstractA graph G is retract rigid if any retract of itself is isomorphic to G. The Cartesian produc...
We show that non-domination results for targets that are not dominated by products are stable under ...
Every connected graph G with radius r(G) and independence number α(G) obeys α(G) ≥ r(G). Recently th...
DOI
Add to ORKG