Second International American Conference México: 1901-1902: Organization of the Conference, Projects, Reports, Motions, Debates and Resolutions

UANL

Overview of the First Phylogenomics Conference

Affiliation: H. Philippe: Département de Biochimie, Université de Montréal

Question period of the Liberal Neutrality Conference (May 1-3, 2008)

This is the audio recording of all discussion sessions of the International Conference on the Re-evaluation of Liberal Neutrality organized by CRÉUM, Montreal May 1-3 2008. (The conference announcement is at http://www.creum.umontreal.ca/spip.php?article765) // Ceci est l'enregistrement audio des périodes de discussion du colloque organisé par le CRÉUM (Montréal, 1-3 mai 2008) et portant sur une ré-évaluation de la neutralité libérale. (L'annonce du colloque est à l'adresse http://www.creum.umontreal.ca/spip.php?article765)

"Breaking the Silence: International conference on the Indian residential schools commission of Canada" ; "Briser le silence: Colloque international sur la commission de vérité et de réconciliation sur les pensionnats indiens".

This is the full audio recording of the "Breaking the silence : International conference on the Indian residential schools commission of Canada" that took place at the University of Montreal on September 26-27, 2008. Enregistrement audio complets du colloque "Briser le silence" sur la Commission de vérité et de réconciliation sur les pensionnats indiens, ayant eu lieu à Montréal les 26 et 27 septembre 2008.

Liberation from Below : the Caribbean Conference Committee of Montreal and the global new left

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

A Note On Some Domination Parameters in Graph Products

In this paper, we study the domination number, the global dom ination number, the cographic domination number, the global co graphic domination number and the independent domination number of all the graph products which are non-complete extended p-sums (NEPS) of two graphs.

The P3 Intersection Graph

We define a new graph operator called the P3 intersection graph, P3(G)- the intersection graph of all induced 3-paths in G. A characterization of graphs G for which P-3 (G) is bipartite is given . Forbidden subgraph characterization for P3 (G) having properties of being chordal , H-free, complete are also obtained . For integers a and b with a > 1 and b > a - 1, it is shown that there exists a graph G such that X(G) = a, X(P3( G)) = b, where X is the chromatic number of G. For the domination number -y(G), we construct graphs G such that -y(G) = a and -y (P3(G)) = b for any two positive numbers a > 1 and b. Similar construction for the independence number and radius, diameter relations are also discussed.

The Edge C4 Graph of a Graph

Abstract. The edge C4 graph E4(G) of a graph G has all the edges of Gas its vertices, two vertices in E4(G) are adjacent if their corresponding edges in G are either incident or are opposite edges of some C4. In this paper, characterizations for E4(G) being connected, complete, bipartite, tree etc are given. We have also proved that E4(G) has no forbidden subgraph characterization. Some dynamical behaviour such as convergence, mortality and touching number are also studied

GALLAI AND ANTI-GALLAI GRAPHS OF A GRAPH

Abstract. The paper deals with graph operators-the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs and the anti-Gallai graphs to be H-free for any finite graph H. The case of complement reducible graphs-cographs is discussed in detail. Some relations between the chromatic number, the radius and the diameter of a graph and its Gallai and anti-Gallai graphs are also obtained.

Studies on some graph operators and related topics

Department of Mathematics, Cochin University of Science and Technology

Studies on Some Graph Classes

Department of Mathematics, Cochin University of Science and Technology

Studies on some generalizations of line graph and the power domination problem in graphs

Department of Mathematics, Cochin University of Science and Technology