Displaying similar documents to “On the graph on a Weyl group being an interval graph.”

More on the girth of graphs on Weyl groups

Samy A. Youssef, S. G. Hulsurkar (1993)

Archivum Mathematicum

Similarity:

The girth of graphs on Weyl groups, with no restriction on the associated root system, is determined. It is shown that the girth, when it is defined, is 3 except for at most four graphs for which it does not exceed 4.

On connectedness of graphs on direct product of Weyl groups

Samy A. Youssef, S. G. Hulsurkar (1995)

Archivum Mathematicum

Similarity:

In this paper, we have studied the connectedness of the graphs on the direct product of the Weyl groups. We have shown that the number of the connected components of the graph on the direct product of the Weyl groups is equal to the product of the numbers of the connected components of the graphs on the factors of the direct product. In particular, we show that the graph on the direct product of the Weyl groups is connected iff the graph on each factor of the direct product is...

A Note on Total Graphs

S.F. Forouhandeh, N. Jafari Rad, B.H. Vaqari Motlagh, H.P. Patil, R. Pandiya Raj (2015)

Discussiones Mathematicae Graph Theory

Similarity:

Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.

The Existence Of P≥3-Factor Covered Graphs

Sizhong Zhou, Jiancheng Wu, Tao Zhang (2017)

Discussiones Mathematicae Graph Theory

Similarity:

A spanning subgraph F of a graph G is called a P≥3-factor of G if every component of F is a path of order at least 3. A graph G is called a P≥3-factor covered graph if G has a P≥3-factor including e for any e ∈ E(G). In this paper, we obtain three sufficient conditions for graphs to be P≥3-factor covered graphs. Furthermore, it is shown that the results are sharp.

The periphery graph of a median graph

Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh (2010)

Discussiones Mathematicae Graph Theory

Similarity:

The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are...