On connectedness of graphs on direct product of Weyl groups

Samy A. Youssef; S. G. Hulsurkar

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “On connectedness of graphs on direct product of Weyl groups”

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 the graph on a Weyl group being an interval graph.

Patel, Hemendra K., Hulsurkar, Suresh G. (1998)

Revista Colombiana de Matemáticas

Similarity:

On the structure of $k$ -connected graphs.

Karpov, D.V., Pastor, A.V. (2000)

Zapiski Nauchnykh Seminarov POMI

Similarity:

A note on minimally 3-connected graphs

Víctor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia (2004)

Discussiones Mathematicae Graph Theory

Similarity:

If G is a minimally 3-connected graph and C is a double cover of the set of edges of G by irreducible walks, then |E(G)| ≥ 2| C| - 2.

On connectedness of graphs on Weyl groups of type $A_{n}$ ( $n \geq 4$ )

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

Archivum Mathematicum

Similarity:

Connected simple graphs and a selection problem

F. Burton Jones (1975)

Czechoslovak Mathematical Journal

Similarity:

Displaying similar documents to “On connectedness of graphs on direct product of Weyl groups”

More on the girth of graphs on Weyl groups

On the graph on a Weyl group being an interval graph.

On the structure of k -connected graphs.

A note on minimally 3-connected graphs

On connectedness of graphs on Weyl groups of type A n ( n ≥ 4 )

Connected simple graphs and a selection problem

On the structure of $k$ -connected graphs.

On connectedness of graphs on Weyl groups of type $A_{n}$ ( $n \geq 4$ )