AbstractFor a tree T and an integer k⩾1, it is well known that the kth power Tk of T is strongly chordal and hence has a strong elimination ordering of its vertices. In this note we obtain a complete characterization of strongly simplicial vertices of Tk, thereby characterizing all strong elimination orderings of the vertices of Tk
AMS Subject Classication: 05C62 Abstract. We consider k-th power of upper bound graphs. According to...
We study the concept of strong equality of domination parameters. Let P1 and P2 be properties of ver...
Let P1 and P2 be properties of vertex subsets of a graph G, and assume that every subset of V (G) wi...
AbstractFor a tree T and an integer k⩾1, it is well known that the kth power Tk of T is strongly cho...
AbstractIn a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k≥1, a gr...
AbstractTotal graphs of trees were proved strongly chordal by Martin Farber. We give a new proof of ...
AbstractFor an undirected graph G the kth power Gk of G is the graph with the same vertex set as G w...
AbstractLet G = (V,E) be a finite undirected connected graph. We show that there is a common perfect...
A graph G ′ = (V,E′) is defined to be the nth power of a graph G = (V,E) if E ′ = {{x, y} | d(x, ...
AbstractIn this paper those graphs are studied for which a so-called strong ordering of the vertex s...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
AbstractIn this paper we present several characterizations of the class of strongly chordal graphs. ...
AbstractWe say that, for k≥2 and ℓ>k, a tree T with distance function dT(x,y) is a (k,ℓ)-leaf root o...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
AbstractWe study the concept of strong equality of domination parameters. Let P1 and P2 be propertie...
AMS Subject Classication: 05C62 Abstract. We consider k-th power of upper bound graphs. According to...
We study the concept of strong equality of domination parameters. Let P1 and P2 be properties of ver...
Let P1 and P2 be properties of vertex subsets of a graph G, and assume that every subset of V (G) wi...
AbstractFor a tree T and an integer k⩾1, it is well known that the kth power Tk of T is strongly cho...
AbstractIn a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k≥1, a gr...
AbstractTotal graphs of trees were proved strongly chordal by Martin Farber. We give a new proof of ...
AbstractFor an undirected graph G the kth power Gk of G is the graph with the same vertex set as G w...
AbstractLet G = (V,E) be a finite undirected connected graph. We show that there is a common perfect...
A graph G ′ = (V,E′) is defined to be the nth power of a graph G = (V,E) if E ′ = {{x, y} | d(x, ...
AbstractIn this paper those graphs are studied for which a so-called strong ordering of the vertex s...
AbstractIn this paper, we present a simple charactrization of strongly chordal graphs. A chordal gra...
AbstractIn this paper we present several characterizations of the class of strongly chordal graphs. ...
AbstractWe say that, for k≥2 and ℓ>k, a tree T with distance function dT(x,y) is a (k,ℓ)-leaf root o...
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,.....
AbstractWe study the concept of strong equality of domination parameters. Let P1 and P2 be propertie...
AMS Subject Classication: 05C62 Abstract. We consider k-th power of upper bound graphs. According to...
We study the concept of strong equality of domination parameters. Let P1 and P2 be properties of ver...
Let P1 and P2 be properties of vertex subsets of a graph G, and assume that every subset of V (G) wi...
DOI
Add to ORKG