Programme

Venue:
Park Centre
Technopark Campus
Thiruvananthapuram – 695 581
India
schedule-Indo-slov2013-final (pdf file)

Day 1: Friday,  22-02-2013

08.45-09.30

Registration

09.30-10.30

Inauguration

10.30-10.45

Tea

Session 1:     10.45–12.45           Chair: Sandi Klavžar

10.45–11.45

Plenary talk: Wilfried Imrich: Symmetry breaking in graphs and groups

11.45–12.15

Invited talk: Paul Dorbec: A survey on power domination in graphs

12.15–12.45

Invited talk: Boštjan Brešar:Domination game on graphs

12.45–14.00

Lunch

Session 2:     14.00–15.00           Chair: Ambat Vijayakumar

14.00–14.30

Invited talk: R. Balakrishnan: Cartesian product of oriented graphs with oriented hypercubes

14.30–15.00

Invited talk: Aleksander Vesel:L(2,1)-labeling of strong products of  paths and cycles

15.00–15.15

Tea

Session 3:     15.15–17.00         Chair: Boštjan Brešar    Metric graph theory

15.15-15.30

Ajitha R.S : Algorithms for remoteness function, median and antimedian sets on l1 graphs

15.30-15.45

Kishori P. Narayankar : Critically median graphs

15.45-16.00

Anandavally K Lakshmikuttyamma: Axiomatic characterization of the interval function of trees

16.00-16.15       

Pravas K: Convex median and anti-median at prescribed distance

16.15-16.30

Ajitha R S: Consensus strategies on weighted graphs

16.30-16.45       

Ram Kumar R: Connected fair sets in graphs

16.45-17.00       

Discussion

Session 4:  15.15–17.00   Chair: Petra Žigert Pleteršek    Graph products

15.15-15.30

Chithra M.R.:        Component factors of the Cartesian product of graphs

15.30-15.45

Bijo S Anand:        Some Steiner concepts on lexicographic products of graphs

15.45-16.00

Manju Menon: Some distance notions in lexicographic product of graphs

16.00-16.15       

S Devi Yamini:  c2-join and one-three join

16.15-16.30

Kavaskar T: On b-continuty of Cartesian product of odd graphs

16.30-16.45       

Prasanth G. Narasimha-Shenoi: Helly and exchange number of graph convexities in Lexicographic product of graphs

16.45-17.00       

Lydia Ostermeier: Grid property and product-like hypergraphs

Day 2: Saturday, 23-02-2013

Session 5:   9.30–11.00           Chair: Subir Kumar Ghosh

9.30–10.30

Plenary talk: S.A. Choudum: An update on Vizing’s conjectures on edge colorings

10.30–11.00

Invited talk: Jérémie Chalopin: A topological characterization of basis graphs of matroids

11.00–11.15

Tea

Session 6:   11.15-12.45         Chair: Ramesh Krishnamurthy

11.15–11.45

Invited talk: Subir Kumar Ghosh: Visibility graph theory for points

11.45–12.15

Invited talk: Yoomi Rho: Distance labellings of weighted graphs

12.15–12.45

Invited talk: Robert Jajcay: Small vertex-transitive and Cayley graphs of given degree and girth

12.45–14.15

Lunch

Session 7:  14.15–16.00         Chair: Matjaž Kovše

14.15-14.30

Pravin Garg: Characterization of the tensor product of two signed graphs

14.30-14.45

Sameera Gupta: On imbalances of edges in a graph

14.45-15.00

Biswajit Deb: On S-reachability in graphs

15.00-15.15

Ayushi Dhama: On the unitary Cayley meet signed graphs Sn^

15.15-15.30

Nirmala Achuthan: On triangle-free graphs of order 10 with prescribed 1-defective chromatic number

15.30-15.45

Navamani Gnanaprakasam: Eternal m-security in graphs

15.45-16.00

Mary Jothi: n-Colourable super strongly perfect graphs

16.00–16.15

Tea

Session 8:   14.15–15.45      Chair:  Paul Dorbec

14.15-14.30

Ram Band: The nodal count {0, 1, 2, 3,…} implies the graph is a tree

14.30-14.45

Baiju Sukumaran: Cover-incomparability graphs, line graphs, 2-colored and 3-colored posets

14.45-15.00

Petra Žigert Pleteršek: The structure of the resonance graphs of some carbon nanotubes

15.00-15.15

Vivek Nittoor:  Balanced tanner units and their properties

15.15-15.30

Vivek Nittoor : Partition parameters for girth maximum (m, r) BTUs

15.30-15.45

Revathi Ranganathan: Modular multiplicative divisor labeling of some path related graphs

15.45-16.00

Angel Dharmakkan: Characterization of complete flowers using covers

Session 9:  16.15–17.15          Chair: Martin Škoviera

16.15–16.45

Invited talk:  N.R. Achuthan: On minimal triangle-free (3;k)-defective chromatic graphs

16.45–17.15

Invited talk:  N. Narayanan: Strong edge colouring – a short survey

17.45–19.15

Cultural program

20.00–22.00

Conference dinner

Day 3: Sunday, 24-02-2013

Session 10:   9.30–11.00        Chair: Jérémie Chalopin

9.30–10.30

Plenary talk: Peter Stadler: Graph grammars and directed hypergraphs: Discrete models of chemistry

10.30–11.00

Invited talk: Sandi Klavžar: New results on the Hosoya polynomial of a graph

11.00–11.15

 Tea

Session 11:   11.15–12.45       Chair: R. Balakrishnan

11.15–11.45

Invited talk: Martin Škoviera: Cycle bases, matchings, and the maximum genus of a graph

11.45–12.15

Invited talk: Aparna Lakshmanan: Triangles in graphs

12.15–12.45

Invited talk: Ramesh Krishnamurthy: The cyclical scheduling problem

12.45–14.00

Lunch

Session 12:  14.00–15.00      Chair: Nirmala Achuthan

14.00–14.30

Invited talk: Matjaž Kovše: Topological representations of partial cubes

14.30–15.00

Invited talk: Manoj Changat: Transit functions towards a theory of  betweenness

15.00–15.45

Valedictory session & Certificate distribution

15.45

Tea

Advertisements