toughness and kronecker product of graphs - ime-uspyoshi/focm2014/talks/jaume.pdf · 2014. 12....
TRANSCRIPT
![Page 1: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/1.jpg)
Index Preliminaries Main Result UCG
Toughness and Kronecker Product of Graphs
Authors: Dr. Daniel A. Jaume 1
Departamento de MatemáticasUniversidad Nacional de San Luis, Argentina
—FoCM 2014 CoferenceMontevideo, Uruguay
December 11, 2014
[email protected] A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 2: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/2.jpg)
Index Preliminaries Main Result UCG
Vulnerability
Given a connected graph G we ask:
1 (minimun) size of a vertex cut set S ⊂ V (G )
2 number of remaining connected components k(G − S)
3 size of the largest connected component m(G − S)
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 3: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/3.jpg)
Index Preliminaries Main Result UCG
Vulnerability
Given a connected graph G we ask:
1 (minimun) size of a vertex cut set S ⊂ V (G )
2 number of remaining connected components k(G − S)
3 size of the largest connected component m(G − S)
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 4: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/4.jpg)
Index Preliminaries Main Result UCG
Vulnerability
Given a connected graph G we ask:
1 (minimun) size of a vertex cut set S ⊂ V (G )
2 number of remaining connected components k(G − S)
3 size of the largest connected component m(G − S)
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 5: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/5.jpg)
Index Preliminaries Main Result UCG
(Vertex) Vulnerability parameters
192? connectivity, κ(G ), deal wiht 11973 Chvátal’s toughness, t(G ), deal with 1 and 2.1978 Jung’s scattering number, sc(G ), deal with 1 and 2.1987 Barefoot-Entringer-Swart’s integrity, I (G ), deal with 1 and 3.1992 Cozzens-Moazzami-Stueckle’s tenacity, T (G ), deal with 1, 2
and 3.2004 Li-Zhang-Li’s rupture degree, r(G ), deal with 1, 2 and 3.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 6: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/6.jpg)
Index Preliminaries Main Result UCG
(Vertex) Vulnerability parameters
192? connectivity, κ(G ), deal wiht 11973 Chvátal’s toughness, t(G ), deal with 1 and 2.1978 Jung’s scattering number, sc(G ), deal with 1 and 2.1987 Barefoot-Entringer-Swart’s integrity, I (G ), deal with 1 and 3.1992 Cozzens-Moazzami-Stueckle’s tenacity, T (G ), deal with 1, 2
and 3.2004 Li-Zhang-Li’s rupture degree, r(G ), deal with 1, 2 and 3.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 7: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/7.jpg)
Index Preliminaries Main Result UCG
(Vertex) Vulnerability parameters
192? connectivity, κ(G ), deal wiht 11973 Chvátal’s toughness, t(G ), deal with 1 and 2.1978 Jung’s scattering number, sc(G ), deal with 1 and 2.1987 Barefoot-Entringer-Swart’s integrity, I (G ), deal with 1 and 3.1992 Cozzens-Moazzami-Stueckle’s tenacity, T (G ), deal with 1, 2
and 3.2004 Li-Zhang-Li’s rupture degree, r(G ), deal with 1, 2 and 3.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 8: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/8.jpg)
Index Preliminaries Main Result UCG
(Vertex) Vulnerability parameters
192? connectivity, κ(G ), deal wiht 11973 Chvátal’s toughness, t(G ), deal with 1 and 2.1978 Jung’s scattering number, sc(G ), deal with 1 and 2.1987 Barefoot-Entringer-Swart’s integrity, I (G ), deal with 1 and 3.1992 Cozzens-Moazzami-Stueckle’s tenacity, T (G ), deal with 1, 2
and 3.2004 Li-Zhang-Li’s rupture degree, r(G ), deal with 1, 2 and 3.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 9: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/9.jpg)
Index Preliminaries Main Result UCG
(Vertex) Vulnerability parameters
192? connectivity, κ(G ), deal wiht 11973 Chvátal’s toughness, t(G ), deal with 1 and 2.1978 Jung’s scattering number, sc(G ), deal with 1 and 2.1987 Barefoot-Entringer-Swart’s integrity, I (G ), deal with 1 and 3.1992 Cozzens-Moazzami-Stueckle’s tenacity, T (G ), deal with 1, 2
and 3.2004 Li-Zhang-Li’s rupture degree, r(G ), deal with 1, 2 and 3.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 10: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/10.jpg)
Index Preliminaries Main Result UCG
(Vertex) Vulnerability parameters
192? connectivity, κ(G ), deal wiht 11973 Chvátal’s toughness, t(G ), deal with 1 and 2.1978 Jung’s scattering number, sc(G ), deal with 1 and 2.1987 Barefoot-Entringer-Swart’s integrity, I (G ), deal with 1 and 3.1992 Cozzens-Moazzami-Stueckle’s tenacity, T (G ), deal with 1, 2
and 3.2004 Li-Zhang-Li’s rupture degree, r(G ), deal with 1, 2 and 3.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 11: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/11.jpg)
Index Preliminaries Main Result UCG
Toughness
DefinitionGiven a connected non-complete graph G , the toughness of G is:
t(G ) := min|S |
k(G − S)
where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition t(Kn) := +∞
Example
t(Cn) = 1, n ≥ 3.t(Kk,n−k) =
kn−k , where 1 ≤ k ≤ n
2 .
t(Petersen graph) = 43 .
Every Hamiltonian graph have toughness at least 1.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 12: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/12.jpg)
Index Preliminaries Main Result UCG
Toughness
DefinitionGiven a connected non-complete graph G , the toughness of G is:
t(G ) := min|S |
k(G − S)
where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition t(Kn) := +∞
Example
t(Cn) = 1, n ≥ 3.t(Kk,n−k) =
kn−k , where 1 ≤ k ≤ n
2 .
t(Petersen graph) = 43 .
Every Hamiltonian graph have toughness at least 1.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 13: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/13.jpg)
Index Preliminaries Main Result UCG
Toughness
DefinitionGiven a connected non-complete graph G , the toughness of G is:
t(G ) := min|S |
k(G − S)
where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition t(Kn) := +∞
Example
t(Cn) = 1, n ≥ 3.t(Kk,n−k) =
kn−k , where 1 ≤ k ≤ n
2 .
t(Petersen graph) = 43 .
Every Hamiltonian graph have toughness at least 1.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 14: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/14.jpg)
Index Preliminaries Main Result UCG
Toughness
DefinitionGiven a connected non-complete graph G , the toughness of G is:
t(G ) := min|S |
k(G − S)
where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition t(Kn) := +∞
Example
t(Cn) = 1, n ≥ 3.t(Kk,n−k) =
kn−k , where 1 ≤ k ≤ n
2 .
t(Petersen graph) = 43 .
Every Hamiltonian graph have toughness at least 1.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 15: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/15.jpg)
Index Preliminaries Main Result UCG
Toughness
DefinitionGiven a connected non-complete graph G , the toughness of G is:
t(G ) := min|S |
k(G − S)
where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition t(Kn) := +∞
Example
t(Cn) = 1, n ≥ 3.t(Kk,n−k) =
kn−k , where 1 ≤ k ≤ n
2 .
t(Petersen graph) = 43 .
Every Hamiltonian graph have toughness at least 1.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 16: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/16.jpg)
Index Preliminaries Main Result UCG
Scattering number
DefinitionGiven a connected non-complete graph G , the scattering numberof G is:
sc(G ) := max {k(G − S)− |S |}
where the maximum is taken over all the vertex-cut setsS ⊂ V (G ). By definition sc(Kn) := −∞
Example
sc(Cn) = 0, for n ≥ 4.sc(Pn) = 1, for n ≥ 3.sc(Km,n) = n −m, if m ≤ n and n ≥ 2.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 17: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/17.jpg)
Index Preliminaries Main Result UCG
Scattering number
DefinitionGiven a connected non-complete graph G , the scattering numberof G is:
sc(G ) := max {k(G − S)− |S |}
where the maximum is taken over all the vertex-cut setsS ⊂ V (G ). By definition sc(Kn) := −∞
Example
sc(Cn) = 0, for n ≥ 4.sc(Pn) = 1, for n ≥ 3.sc(Km,n) = n −m, if m ≤ n and n ≥ 2.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 18: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/18.jpg)
Index Preliminaries Main Result UCG
Scattering number
DefinitionGiven a connected non-complete graph G , the scattering numberof G is:
sc(G ) := max {k(G − S)− |S |}
where the maximum is taken over all the vertex-cut setsS ⊂ V (G ). By definition sc(Kn) := −∞
Example
sc(Cn) = 0, for n ≥ 4.sc(Pn) = 1, for n ≥ 3.sc(Km,n) = n −m, if m ≤ n and n ≥ 2.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 19: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/19.jpg)
Index Preliminaries Main Result UCG
Scattering number
DefinitionGiven a connected non-complete graph G , the scattering numberof G is:
sc(G ) := max {k(G − S)− |S |}
where the maximum is taken over all the vertex-cut setsS ⊂ V (G ). By definition sc(Kn) := −∞
Example
sc(Cn) = 0, for n ≥ 4.sc(Pn) = 1, for n ≥ 3.sc(Km,n) = n −m, if m ≤ n and n ≥ 2.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 20: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/20.jpg)
Index Preliminaries Main Result UCG
Integrity
DefinitionGiven a connected non-complete graph G , the integrity of G is:
I (G ) := min{|S |+m(G − S)}
where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition I (Kn) := n.
Example
I (Pn) = d2√n + 1e − 2.
I (Km,n) = 1+min{m, n}.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 21: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/21.jpg)
Index Preliminaries Main Result UCG
Integrity
DefinitionGiven a connected non-complete graph G , the integrity of G is:
I (G ) := min{|S |+m(G − S)}
where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition I (Kn) := n.
Example
I (Pn) = d2√n + 1e − 2.
I (Km,n) = 1+min{m, n}.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 22: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/22.jpg)
Index Preliminaries Main Result UCG
Integrity
DefinitionGiven a connected non-complete graph G , the integrity of G is:
I (G ) := min{|S |+m(G − S)}
where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition I (Kn) := n.
Example
I (Pn) = d2√n + 1e − 2.
I (Km,n) = 1+min{m, n}.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 23: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/23.jpg)
Index Preliminaries Main Result UCG
Tenacity
DefinitionGiven a connected non-complete graph G , the tenacity of G is
T (G ) := min{|S |+m(G − S)
k(G − S)
}where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition T (Kn) := n.
Example
T (Pn) = 1, if n is odd, and T (Pn) =n+2n , if n is even.
T (Cn) =n+3n−1 , if n is odd, and T (Pn) =
n+2n , if n is even.
T (Kk,n−k) =k+1n−k , for 1 ≤ k ≤ n
2
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 24: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/24.jpg)
Index Preliminaries Main Result UCG
Tenacity
DefinitionGiven a connected non-complete graph G , the tenacity of G is
T (G ) := min{|S |+m(G − S)
k(G − S)
}where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition T (Kn) := n.
Example
T (Pn) = 1, if n is odd, and T (Pn) =n+2n , if n is even.
T (Cn) =n+3n−1 , if n is odd, and T (Pn) =
n+2n , if n is even.
T (Kk,n−k) =k+1n−k , for 1 ≤ k ≤ n
2
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 25: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/25.jpg)
Index Preliminaries Main Result UCG
Tenacity
DefinitionGiven a connected non-complete graph G , the tenacity of G is
T (G ) := min{|S |+m(G − S)
k(G − S)
}where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition T (Kn) := n.
Example
T (Pn) = 1, if n is odd, and T (Pn) =n+2n , if n is even.
T (Cn) =n+3n−1 , if n is odd, and T (Pn) =
n+2n , if n is even.
T (Kk,n−k) =k+1n−k , for 1 ≤ k ≤ n
2
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 26: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/26.jpg)
Index Preliminaries Main Result UCG
Tenacity
DefinitionGiven a connected non-complete graph G , the tenacity of G is
T (G ) := min{|S |+m(G − S)
k(G − S)
}where the minimum is taken over all the vertex-cut sets S ⊂ V (G ).By definition T (Kn) := n.
Example
T (Pn) = 1, if n is odd, and T (Pn) =n+2n , if n is even.
T (Cn) =n+3n−1 , if n is odd, and T (Pn) =
n+2n , if n is even.
T (Kk,n−k) =k+1n−k , for 1 ≤ k ≤ n
2
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 27: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/27.jpg)
Index Preliminaries Main Result UCG
Rupture degree
DefinitionGiven a connected non-complete graph G , the rupture degree ofG is
r(G ) := max {k(G − S)− |S | −m(G − S)}
where the maximun is taken over all the vertex-cut sets S ⊂ V (G ).By definition r(Kn) := 1− n.
Example
r(Pn) = 0, if n is odd, and r(Pn) = −1, if n is even.r(Cn) = −2, if n is odd, and r(Pn) = −1, if n is even.r(Kk,n−k) = n − 2k − 1, for 1 ≤ k ≤ n
2
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 28: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/28.jpg)
Index Preliminaries Main Result UCG
Rupture degree
DefinitionGiven a connected non-complete graph G , the rupture degree ofG is
r(G ) := max {k(G − S)− |S | −m(G − S)}
where the maximun is taken over all the vertex-cut sets S ⊂ V (G ).By definition r(Kn) := 1− n.
Example
r(Pn) = 0, if n is odd, and r(Pn) = −1, if n is even.r(Cn) = −2, if n is odd, and r(Pn) = −1, if n is even.r(Kk,n−k) = n − 2k − 1, for 1 ≤ k ≤ n
2
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 29: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/29.jpg)
Index Preliminaries Main Result UCG
Rupture degree
DefinitionGiven a connected non-complete graph G , the rupture degree ofG is
r(G ) := max {k(G − S)− |S | −m(G − S)}
where the maximun is taken over all the vertex-cut sets S ⊂ V (G ).By definition r(Kn) := 1− n.
Example
r(Pn) = 0, if n is odd, and r(Pn) = −1, if n is even.r(Cn) = −2, if n is odd, and r(Pn) = −1, if n is even.r(Kk,n−k) = n − 2k − 1, for 1 ≤ k ≤ n
2
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 30: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/30.jpg)
Index Preliminaries Main Result UCG
Rupture degree
DefinitionGiven a connected non-complete graph G , the rupture degree ofG is
r(G ) := max {k(G − S)− |S | −m(G − S)}
where the maximun is taken over all the vertex-cut sets S ⊂ V (G ).By definition r(Kn) := 1− n.
Example
r(Pn) = 0, if n is odd, and r(Pn) = −1, if n is even.r(Cn) = −2, if n is odd, and r(Pn) = −1, if n is even.r(Kk,n−k) = n − 2k − 1, for 1 ≤ k ≤ n
2
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 31: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/31.jpg)
Index Preliminaries Main Result UCG
Kronecker Product
DefinitionLet G ,H be two graphs. The Kronecker Product of both is thegraph (Nešetřil notation)
G × H
with vertex setV (G × H) = V (G )× V (H)(Cartesian product of sets) and edge setE (G × H) = {{(a, b), (a′, b′)}| {a, a′} ∈ E (G ), {b, b′} ∈ E (H)}
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 32: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/32.jpg)
Index Preliminaries Main Result UCG
Results of Mamut-Vumar 2007, IPL
TheoremLet n y m be integer with n ≥ m ≥ 2 and n ≥ 3. Then:
1 t(Km × Kn) = m − 1
2 sc(Km × Kn) =
{2− (m − 1)(n − 1), if m = n2n −mn, otherwise
3 I (Km ⊗ Kn) = mn − n + 14 T (Km ⊗ Kn) = m + 1
n − 15 r(Km ⊗ Kn) =???
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 33: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/33.jpg)
Index Preliminaries Main Result UCG
Results of Mamut-Vumar 2007, IPL
TheoremLet n y m be integer with n ≥ m ≥ 2 and n ≥ 3. Then:
1 t(Km × Kn) = m − 1
2 sc(Km × Kn) =
{2− (m − 1)(n − 1), if m = n2n −mn, otherwise
3 I (Km ⊗ Kn) = mn − n + 14 T (Km ⊗ Kn) = m + 1
n − 15 r(Km ⊗ Kn) =???
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 34: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/34.jpg)
Index Preliminaries Main Result UCG
Results of Mamut-Vumar 2007, IPL
TheoremLet n y m be integer with n ≥ m ≥ 2 and n ≥ 3. Then:
1 t(Km × Kn) = m − 1
2 sc(Km × Kn) =
{2− (m − 1)(n − 1), if m = n2n −mn, otherwise
3 I (Km ⊗ Kn) = mn − n + 14 T (Km ⊗ Kn) = m + 1
n − 15 r(Km ⊗ Kn) =???
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 35: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/35.jpg)
Index Preliminaries Main Result UCG
Results of Mamut-Vumar 2007, IPL
TheoremLet n y m be integer with n ≥ m ≥ 2 and n ≥ 3. Then:
1 t(Km × Kn) = m − 1
2 sc(Km × Kn) =
{2− (m − 1)(n − 1), if m = n2n −mn, otherwise
3 I (Km ⊗ Kn) = mn − n + 14 T (Km ⊗ Kn) = m + 1
n − 15 r(Km ⊗ Kn) =???
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 36: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/36.jpg)
Index Preliminaries Main Result UCG
Results of Mamut-Vumar 2007, IPL
TheoremLet n y m be integer with n ≥ m ≥ 2 and n ≥ 3. Then:
1 t(Km × Kn) = m − 1
2 sc(Km × Kn) =
{2− (m − 1)(n − 1), if m = n2n −mn, otherwise
3 I (Km ⊗ Kn) = mn − n + 14 T (Km ⊗ Kn) = m + 1
n − 15 r(Km ⊗ Kn) =???
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 37: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/37.jpg)
Index Preliminaries Main Result UCG
Mamut-Vumar-Problem
Problem (Mamut y Vumar (2007))
Determine good bounds for vunerability parameters of G × H, withG and H arbitrary connected graphs.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 38: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/38.jpg)
Index Preliminaries Main Result UCG
Our little result
Theorem
Let G be a connected non-complete graph such that t(G ) ≥ n2 ,
with n ≥ 3. Thent(G × Kn) = n − 1
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 39: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/39.jpg)
Index Preliminaries Main Result UCG
Unitary Cayley Graph
DefinitionLet n be a positive integer greater than 1. The Unitary CayleyGraph Xn is defined as the graph with vertex setV (Xn) = {0, 1, ..., n − 1}and edge setE (Xn) = {(a, b)| a, b ∈ Zn, gcd(a− b, n) = 1}
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 40: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/40.jpg)
Index Preliminaries Main Result UCG
Example: X10
0
2
4
6
8
1
3
5
7
9
U10 = {1, 3, 7, 9}
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 41: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/41.jpg)
Index Preliminaries Main Result UCG
Example: X10
0
2
4
6
8
1
3
5
7
9
U10 = {1, 3, 7, 9}
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 42: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/42.jpg)
Index Preliminaries Main Result UCG
Example: X10
0
2
4
6
8
1
3
5
7
9
U10 = {1, 3, 7, 9}
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 43: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/43.jpg)
Index Preliminaries Main Result UCG
Example: X10
0
2
4
6
8
1
3
5
7
9
U10 = {1, 3, 7, 9}
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 44: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/44.jpg)
Index Preliminaries Main Result UCG
Example: X10
0
2
4
6
8
1
3
5
7
9
U10 = {1, 3, 7, 9}
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 45: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/45.jpg)
Index Preliminaries Main Result UCG
Results by Klotz and Sander 2007, EJC
Some properties of unitary Cayley Graphs were determined by Klotzand Sander [4].Here, p1(n) will denote the smallest prime number p such that p|n.
Theorem
Let Xn be a Unitary Cayley Graph of order n then1 the independence number ind(Xn) =
n
p1(n).
2 the vertex connectivity κ(Xn) = ϕ(n).
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 46: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/46.jpg)
Index Preliminaries Main Result UCG
Results by Klotz and Sander 2007, EJC
Some properties of unitary Cayley Graphs were determined by Klotzand Sander [4].Here, p1(n) will denote the smallest prime number p such that p|n.
Theorem
Let Xn be a Unitary Cayley Graph of order n then1 the independence number ind(Xn) =
n
p1(n).
2 the vertex connectivity κ(Xn) = ϕ(n).
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 47: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/47.jpg)
Index Preliminaries Main Result UCG
Results by Klotz and Sander 2007, EJC
Some properties of unitary Cayley Graphs were determined by Klotzand Sander [4].Here, p1(n) will denote the smallest prime number p such that p|n.
Theorem
Let Xn be a Unitary Cayley Graph of order n then1 the independence number ind(Xn) =
n
p1(n).
2 the vertex connectivity κ(Xn) = ϕ(n).
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 48: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/48.jpg)
Index Preliminaries Main Result UCG
Results by Klotz and Sander 2007, EJC
Some properties of unitary Cayley Graphs were determined by Klotzand Sander [4].Here, p1(n) will denote the smallest prime number p such that p|n.
Theorem
Let Xn be a Unitary Cayley Graph of order n then1 the independence number ind(Xn) =
n
p1(n).
2 the vertex connectivity κ(Xn) = ϕ(n).
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 49: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/49.jpg)
Index Preliminaries Main Result UCG
Results by Klotz and Sander 2007, EJC
Some properties of unitary Cayley Graphs were determined by Klotzand Sander [4].Here, p1(n) will denote the smallest prime number p such that p|n.
Theorem
Let Xn be a Unitary Cayley Graph of order n then1 the independence number ind(Xn) =
n
p1(n).
2 the vertex connectivity κ(Xn) = ϕ(n).
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 50: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/50.jpg)
Index Preliminaries Main Result UCG
One result of Ramaswamy and Veena 2009, EJC
Theorem
Given n ∈ Z+, with prime factorization = pα11 . . . pαk
k , wherep1 < ... < pk . Then
Xn∼= Xp
α11× . . .× Xp
αkk
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 51: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/51.jpg)
Index Preliminaries Main Result UCG
radical bound
Given n ∈ Z+, the radical of n, denoted rad(n), is the greastestsquare-free divisor of n.
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) ≥ t(Xrad(n))
Proof.Take a t-vertex-cut-set S ⊂ V (Xn).Z := {i ∈ Zrad(n)| if g ≡ i mod rad(n), then g ∈ S}
|S | ≥ nrad(n) |Z |.
k(Xn − S) ≤ k(Xrad(n) − Z )
t(Xn) =|S |
k(Xn − S)≥
nrad(n) |Z |
nrad(n)k(Xrad(n) − Z )
≥ t(Xrad(n))
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 52: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/52.jpg)
Index Preliminaries Main Result UCG
radical bound
Given n ∈ Z+, the radical of n, denoted rad(n), is the greastestsquare-free divisor of n.
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) ≥ t(Xrad(n))
Proof.Take a t-vertex-cut-set S ⊂ V (Xn).Z := {i ∈ Zrad(n)| if g ≡ i mod rad(n), then g ∈ S}
|S | ≥ nrad(n) |Z |.
k(Xn − S) ≤ k(Xrad(n) − Z )
t(Xn) =|S |
k(Xn − S)≥
nrad(n) |Z |
nrad(n)k(Xrad(n) − Z )
≥ t(Xrad(n))
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 53: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/53.jpg)
Index Preliminaries Main Result UCG
radical bound
Given n ∈ Z+, the radical of n, denoted rad(n), is the greastestsquare-free divisor of n.
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) ≥ t(Xrad(n))
Proof.Take a t-vertex-cut-set S ⊂ V (Xn).Z := {i ∈ Zrad(n)| if g ≡ i mod rad(n), then g ∈ S}
|S | ≥ nrad(n) |Z |.
k(Xn − S) ≤ k(Xrad(n) − Z )
t(Xn) =|S |
k(Xn − S)≥
nrad(n) |Z |
nrad(n)k(Xrad(n) − Z )
≥ t(Xrad(n))
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 54: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/54.jpg)
Index Preliminaries Main Result UCG
radical bound
Given n ∈ Z+, the radical of n, denoted rad(n), is the greastestsquare-free divisor of n.
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) ≥ t(Xrad(n))
Proof.Take a t-vertex-cut-set S ⊂ V (Xn).Z := {i ∈ Zrad(n)| if g ≡ i mod rad(n), then g ∈ S}
|S | ≥ nrad(n) |Z |.
k(Xn − S) ≤ k(Xrad(n) − Z )
t(Xn) =|S |
k(Xn − S)≥
nrad(n) |Z |
nrad(n)k(Xrad(n) − Z )
≥ t(Xrad(n))
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 55: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/55.jpg)
Index Preliminaries Main Result UCG
radical bound
Given n ∈ Z+, the radical of n, denoted rad(n), is the greastestsquare-free divisor of n.
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) ≥ t(Xrad(n))
Proof.Take a t-vertex-cut-set S ⊂ V (Xn).Z := {i ∈ Zrad(n)| if g ≡ i mod rad(n), then g ∈ S}
|S | ≥ nrad(n) |Z |.
k(Xn − S) ≤ k(Xrad(n) − Z )
t(Xn) =|S |
k(Xn − S)≥
nrad(n) |Z |
nrad(n)k(Xrad(n) − Z )
≥ t(Xrad(n))
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 56: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/56.jpg)
Index Preliminaries Main Result UCG
radical bound
Given n ∈ Z+, the radical of n, denoted rad(n), is the greastestsquare-free divisor of n.
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) ≥ t(Xrad(n))
Proof.Take a t-vertex-cut-set S ⊂ V (Xn).Z := {i ∈ Zrad(n)| if g ≡ i mod rad(n), then g ∈ S}
|S | ≥ nrad(n) |Z |.
k(Xn − S) ≤ k(Xrad(n) − Z )
t(Xn) =|S |
k(Xn − S)≥
nrad(n) |Z |
nrad(n)k(Xrad(n) − Z )
≥ t(Xrad(n))
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 57: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/57.jpg)
Index Preliminaries Main Result UCG
Tools
First a very well known result about toughness
Theorem
For every noncomplete graph G ,
κ(G )
ind(G )≤ t(G ) ≤ κ(G )
2
Now, a humble result of us:
TheoremLet p < q be prime numbers and S vertex-cut set with|S | < pq − q then k(Xpq − S) = 2.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 58: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/58.jpg)
Index Preliminaries Main Result UCG
Tools
First a very well known result about toughness
Theorem
For every noncomplete graph G ,
κ(G )
ind(G )≤ t(G ) ≤ κ(G )
2
Now, a humble result of us:
TheoremLet p < q be prime numbers and S vertex-cut set with|S | < pq − q then k(Xpq − S) = 2.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 59: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/59.jpg)
Index Preliminaries Main Result UCG
Tools
First a very well known result about toughness
Theorem
For every noncomplete graph G ,
κ(G )
ind(G )≤ t(G ) ≤ κ(G )
2
Now, a humble result of us:
TheoremLet p < q be prime numbers and S vertex-cut set with|S | < pq − q then k(Xpq − S) = 2.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 60: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/60.jpg)
Index Preliminaries Main Result UCG
[0]3 [1]3 [2]3
3
6
10
9
12
4
7
10
13
2
5
8
11
14
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 61: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/61.jpg)
Index Preliminaries Main Result UCG
[0]3 [1]3 [2]3
3
6
10
9
12
4
7
10
13
2
5
8
11
14
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 62: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/62.jpg)
Index Preliminaries Main Result UCG
[0]3 [1]3 [2]3
3
6
10
9
12
4
7
10
13
2
5
8
11
14
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 63: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/63.jpg)
Index Preliminaries Main Result UCG
[0]3 [1]3 [2]3
3
6
10
9
12
4
7
10
13
2
5
8
11
14
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 64: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/64.jpg)
Index Preliminaries Main Result UCG
[0]3 [1]3 [2]3
3
6
10
9
12
4
7
10
13
2
5
8
11
14
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 65: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/65.jpg)
Index Preliminaries Main Result UCG
Toughness of UCG
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) = p1(n)− 1
Proof.Assume that n is square-free.Induction over the number of prime divisor of n
n = p1p2, and S ⊂ V (Xn) a vertes-cut of Xn
If |S | < p1p2 − p2, then k(Xp1p2 − S) = 2.
|S |k(Xp1p2 − S)
≥ κ(Xp1p2)
2=
(p1 − 1)(p2 − 1)2
≥ p1 − 1
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 66: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/66.jpg)
Index Preliminaries Main Result UCG
Toughness of UCG
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) = p1(n)− 1
Proof.Assume that n is square-free.Induction over the number of prime divisor of n
n = p1p2, and S ⊂ V (Xn) a vertes-cut of Xn
If |S | < p1p2 − p2, then k(Xp1p2 − S) = 2.
|S |k(Xp1p2 − S)
≥ κ(Xp1p2)
2=
(p1 − 1)(p2 − 1)2
≥ p1 − 1
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 67: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/67.jpg)
Index Preliminaries Main Result UCG
Toughness of UCG
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) = p1(n)− 1
Proof.Assume that n is square-free.Induction over the number of prime divisor of n
n = p1p2, and S ⊂ V (Xn) a vertes-cut of Xn
If |S | < p1p2 − p2, then k(Xp1p2 − S) = 2.
|S |k(Xp1p2 − S)
≥ κ(Xp1p2)
2=
(p1 − 1)(p2 − 1)2
≥ p1 − 1
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 68: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/68.jpg)
Index Preliminaries Main Result UCG
Toughness of UCG
TheoremLet Xn be an Unitary Cayley Graph of order n. Thent(Xn) = p1(n)− 1
Proof.Assume that n is square-free.Induction over the number of prime divisor of n
n = p1p2, and S ⊂ V (Xn) a vertes-cut of Xn
If |S | < p1p2 − p2, then k(Xp1p2 − S) = 2.
|S |k(Xp1p2 − S)
≥ κ(Xp1p2)
2=
(p1 − 1)(p2 − 1)2
≥ p1 − 1
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 69: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/69.jpg)
Index Preliminaries Main Result UCG
proof
Proof.If |S | ≥ p1p2 − p2, then
|S |k(Xp1p2 − S)
≥ p1p2 − p2ind(Xp1p2)
= p1 − 1
n = p1p2 . . . pk+1 con p1 < . . . < pk+1
Xn∼= Xp1 × G , where G = Xp2 × ...× Xpk+1
But t(G ) ≥ p2 − 1 by induction hypothesis.Then, t(Xp1 × G ) = p1 − 1.If n is non-square-free, as t(Xrad(n)) ≤ t(Xn) ≤ p1(n)− 1, weare done!.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 70: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/70.jpg)
Index Preliminaries Main Result UCG
proof
Proof.If |S | ≥ p1p2 − p2, then
|S |k(Xp1p2 − S)
≥ p1p2 − p2ind(Xp1p2)
= p1 − 1
n = p1p2 . . . pk+1 con p1 < . . . < pk+1
Xn∼= Xp1 × G , where G = Xp2 × ...× Xpk+1
But t(G ) ≥ p2 − 1 by induction hypothesis.Then, t(Xp1 × G ) = p1 − 1.If n is non-square-free, as t(Xrad(n)) ≤ t(Xn) ≤ p1(n)− 1, weare done!.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 71: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/71.jpg)
Index Preliminaries Main Result UCG
proof
Proof.If |S | ≥ p1p2 − p2, then
|S |k(Xp1p2 − S)
≥ p1p2 − p2ind(Xp1p2)
= p1 − 1
n = p1p2 . . . pk+1 con p1 < . . . < pk+1
Xn∼= Xp1 × G , where G = Xp2 × ...× Xpk+1
But t(G ) ≥ p2 − 1 by induction hypothesis.Then, t(Xp1 × G ) = p1 − 1.If n is non-square-free, as t(Xrad(n)) ≤ t(Xn) ≤ p1(n)− 1, weare done!.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 72: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/72.jpg)
Index Preliminaries Main Result UCG
proof
Proof.If |S | ≥ p1p2 − p2, then
|S |k(Xp1p2 − S)
≥ p1p2 − p2ind(Xp1p2)
= p1 − 1
n = p1p2 . . . pk+1 con p1 < . . . < pk+1
Xn∼= Xp1 × G , where G = Xp2 × ...× Xpk+1
But t(G ) ≥ p2 − 1 by induction hypothesis.Then, t(Xp1 × G ) = p1 − 1.If n is non-square-free, as t(Xrad(n)) ≤ t(Xn) ≤ p1(n)− 1, weare done!.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 73: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/73.jpg)
Index Preliminaries Main Result UCG
proof
Proof.If |S | ≥ p1p2 − p2, then
|S |k(Xp1p2 − S)
≥ p1p2 − p2ind(Xp1p2)
= p1 − 1
n = p1p2 . . . pk+1 con p1 < . . . < pk+1
Xn∼= Xp1 × G , where G = Xp2 × ...× Xpk+1
But t(G ) ≥ p2 − 1 by induction hypothesis.Then, t(Xp1 × G ) = p1 − 1.If n is non-square-free, as t(Xrad(n)) ≤ t(Xn) ≤ p1(n)− 1, weare done!.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 74: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/74.jpg)
Index Preliminaries Main Result UCG
proof
Proof.If |S | ≥ p1p2 − p2, then
|S |k(Xp1p2 − S)
≥ p1p2 − p2ind(Xp1p2)
= p1 − 1
n = p1p2 . . . pk+1 con p1 < . . . < pk+1
Xn∼= Xp1 × G , where G = Xp2 × ...× Xpk+1
But t(G ) ≥ p2 − 1 by induction hypothesis.Then, t(Xp1 × G ) = p1 − 1.If n is non-square-free, as t(Xrad(n)) ≤ t(Xn) ≤ p1(n)− 1, weare done!.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 75: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/75.jpg)
Index Preliminaries Main Result UCG
Tenacity
It is well known that:
TheoremLet G be a non-complete connected graph. Then
t(G ) +1
ind(G )≤ T (G ) ≤ |V (G )| − ind(G ) + 1
ind(G )
With this we can prove that
CorollaryLet Xn a Unitary Cayley Graph of order n. Then
T (Xn) = p1(n)
(1+
1n
)− 1
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 76: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/76.jpg)
Index Preliminaries Main Result UCG
Tenacity
It is well known that:
TheoremLet G be a non-complete connected graph. Then
t(G ) +1
ind(G )≤ T (G ) ≤ |V (G )| − ind(G ) + 1
ind(G )
With this we can prove that
CorollaryLet Xn a Unitary Cayley Graph of order n. Then
T (Xn) = p1(n)
(1+
1n
)− 1
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 77: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/77.jpg)
Index Preliminaries Main Result UCG
Integrity
Remember
DefinitionGiven a non-complete connected graph G , the integrity of G , I (G )is defined as:
min{|S |+m(G − S)}
where the minimum is taken over all the S ⊂ V (G ).
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 78: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/78.jpg)
Index Preliminaries Main Result UCG
A Known Result on Integrity
We will make use of the following known result about integrity:
Theorem
Let G be a k-regular Graph of order n. Then
k + 1 ≤ I (G ) ≤ n − ind(G ) + 1
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 79: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/79.jpg)
Index Preliminaries Main Result UCG
Example: X10
0
2
4
6
8
1
3
5
7
9
t(X10) = 1
I (X10) = 6
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 80: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/80.jpg)
Index Preliminaries Main Result UCG
Example: X10
0
2
4
6
8
1
3
5
7
9
t(X10) = 1
I (X10) = 6
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 81: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/81.jpg)
Index Preliminaries Main Result UCG
Before going on with the results on integrity we will write thebounds for integrity in the language of Unitary Cayley Graphs:
ϕ(n) + 1 ≤ I (Xn) ≤ n − n
p1(n)+ 1
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 82: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/82.jpg)
Index Preliminaries Main Result UCG
Theorem
Let p be a prime number and k ∈ Z+. ThenI (Xpk ) = pk − pk−1 + 1
Proof.We know that
I (Xpk ) ≥ ϕ(pk) + 1 = pk − pk−1 + 1
But we also have that:
I (Xpk ) ≤ pk − pk
p+ 1
= pk − pk−1 + 1
Thus I (Xpk ) = pk − pk−1 + 1 as we wanted to prove.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 83: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/83.jpg)
Index Preliminaries Main Result UCG
Theorem
Let p be a prime number and k ∈ Z+. ThenI (Xpk ) = pk − pk−1 + 1
Proof.We know that
I (Xpk ) ≥ ϕ(pk) + 1 = pk − pk−1 + 1
But we also have that:
I (Xpk ) ≤ pk − pk
p+ 1
= pk − pk−1 + 1
Thus I (Xpk ) = pk − pk−1 + 1 as we wanted to prove.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 84: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/84.jpg)
Index Preliminaries Main Result UCG
Theorem
Let p < q be prime numbers, then I (Xpq) = pq − q + 1
Proof.Let S be a vertex-cut set such that |S | < pq − q. We have thatk(Xpq − S) = 2. Using the pigeonhole principle we have that:
m(Xpq − S) ≥ pq − |S |2
And so we have, using that p < q and that, as S is a vertex-cut,|S | ≥ κ(Xpq) = (p − 1)(q − 1):
|S |+m(Xpq − S) ≥ |S |+ pq − |S |2
≥ |S |+ pq
2≥ (p − 1)(q − 1) + pq
2
≥ pq − p + q
2+
12> pq − q
Assume now that |S | ≥ pq − q, then:
|S |+ N(Xpq − S) ≥ pq − q + 1
And so I (Xpq) = pq − q + 1.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 85: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/85.jpg)
Index Preliminaries Main Result UCG
Proof.
|S |+m(Xpq − S) ≥ (p − 1)(q − 1) + pq
2
≥ pq − p + q
2+
12> pq − q
Assume now that |S | ≥ pq − q, then:
|S |+m(Xpq − S) ≥ pq − q + 1
And so I (Xpq) = pq − q + 1.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 86: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/86.jpg)
Index Preliminaries Main Result UCG
Notice that in both cases the integrity is equal to the upper boundn − n
p1(n)+ 1, we conjecture that this is the case for every Unitary
Cayley Graph.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 87: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/87.jpg)
Index Preliminaries Main Result UCG
GRACIAS!!!!!!!!
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs
![Page 88: Toughness and Kronecker Product of Graphs - IME-USPyoshi/FoCM2014/talks/jaume.pdf · 2014. 12. 13. · IndexPreliminariesMain ResultUCG Toughness and Kronecker Product of Graphs Authors:](https://reader035.vdocuments.mx/reader035/viewer/2022071604/61401366e59fcb3c636a43fb/html5/thumbnails/88.jpg)
Index Preliminaries Main Result UCG
Bibliography
N. Biggs, Algebraic graph theory, Second Edition, Chematicallibrary. Cambridge University Press, 1993.
G. Chartrand and L. Lesniak, Graphs and Digraphs, ThirdEdition,Chapman and Hall, 1996.
C. Godsil and R. Royle, Algebraic graph theory, Graduate Textin Mathematics. Springer, 2001.
W. Klotz and T. Sander, Some properties of unitary Cayleygraphs, The Electronic Journal of Combiantorics 14 (2007),R45, pp. 1-12.
Daniel A. Jaume, Adrián Pastine, Denis E. Videla Vulnerability of Unitary Cayley Graphs