Prime Factorization in the Generalized Hierarchical Product
|
|
- Calvin Morton
- 5 years ago
- Views:
Transcription
1 Prime Factorization in the Generalized Hierarchical Product Sarah Anderson and Kirsti Wash Clemson University January 18, 2014
2 Background Definition A graph G = (V, E) is a set of vertices V (G) together with a set of edges E(G) which are unordered pairs {u, v} of vertices of G [commonly written uv]. If uv E(G) we say that u is adjacent to v. Additionally, if we require u and v to be distinct for the edge uv, then we say G is a simple graph, i.e. G contains no loops. Figure 1: C 5
3 Background Definition Given two graphs G and H, the Cartesian product of G and H, denoted G H, is the graph whose vertex set is V (G) V (H) whereby two vertices (u 1, u 2 ) and (v 1, v 2 ) are adjacent if u 1 v 1 E(G) and u 2 = v 2, or u 1 = v 1 and u 2 v 2 E(H).
4 Background w 2 v 2 u 2 u 1 v 1 w 1 Figure 2: P 3 K 3
5 Background Definition An isomorphism between graphs G and H is a bijection between the vertex sets of G and H f : V (G) V (H) such that uv E(G) if and only if f (u)f (v) E(H).
6 Background Figure 4: Isomorphic copies of K,3 2
7 Definition A graph is prime with respect to a given product if it is nontrivial and cannot be represented as the product of two nontrivial graphs.
8 Definition A graph is prime with respect to a given product if it is nontrivial and cannot be represented as the product of two nontrivial graphs. So if G = G 1 G 2 is prime, then either G 1 or G 2 is K 1.
9 Theorem (Sabidussi 1960, Vizing 1963) Prime factorization with respect to the Cartesian product is not unique in the class of possibly disconnected simple graphs.
10 Theorem (Sabidussi 1960, Vizing 1963) Prime factorization with respect to the Cartesian product is not unique in the class of possibly disconnected simple graphs. Theorem (Sabidussi 1960, Vizing 1963) Every connected graph has a unique prime factor decomposition with respect to the Cartesian product.
11 Theorem (Sabidussi 1960, Vizing 1963) Prime factorization with respect to the Cartesian product is not unique in the class of possibly disconnected simple graphs. Theorem (Sabidussi 1960, Vizing 1963) Every connected graph has a unique prime factor decomposition with respect to the Cartesian product. Cartesian?
12 We wish to show that every connected graph has a unique prime factor decomposition with respect to the Cartesian product.
13 We wish to show that every connected graph has a unique prime factor decomposition with respect to the Cartesian product. We follow the proof found in Handbook of Product Graphs.
14 Definition Consider the Cartesian product G 1 G n. For any index 1 i n, there is a projection map defined as p i (x 1,..., x n ) = x i. p i : G 1 G n G i
15 Definition Consider the Cartesian product G 1 G n. For any index 1 i n, there is a projection map defined as p i (x 1,..., x n ) = x i. p i : G 1 G n G i Definition Given a vertex a = (a 1,..., a n ) of the product G = G 1 G n, the G i -layer through a is the induced subgraph Gi a = {x V (G) p j (x) = a j for j i} = {a 1 } G i {a n }.
16 P 3 K 3 w 2 v 2 u 2 u 1 v 1 w 1
17 P 3 K 3 w 2 v 2 u 2 u 1 v 1 w 1
18 P 3 K 3 w 2 v 2 u 2 u 1 v 1 w 1
19 P 3 K 3 w 2 v 2 u 2 u 1 v 1 w 1
20 Theorem (Sabidussi (1960) and Vizing (1963)) Let φ be an isomorphism between the connected graphs G and H that are representable as Cartesian products G = G 1 G k H = H 1 H l of prime graphs. Then k = l and to any a V (G), there is a permutation π of {1,..., k} such that φ (Gi a) = Hφ(a) π(i) for 1 i k.
21 Theorem (Sabidussi (1960) and Vizing (1963)) Let φ be an isomorphism between the connected graphs G and H that are representable as Cartesian products G = G 1 G k H = H 1 H l of prime graphs. Then k = l and to any a V (G), there is a permutation π of {1,..., k} such that φ (Gi a) = Hφ(a) π(i) for 1 i k. We need to show that φ (Gi a ) is a layer in H.
22 Theorem (Sabidussi (1960) and Vizing (1963)) Let φ be an isomorphism between the connected graphs G and H that are representable as Cartesian products G = G 1 G k H = H 1 H l of prime graphs. Then k = l and to any a V (G), there is a permutation π of {1,..., k} such that φ (Gi a) = Hφ(a) π(i) for 1 i k. We need to show that φ (Gi a ) is a layer in H. How do we do this???
23 Definition A subgraph W G is convex in G if every shortest G-path between vertices of W lies entirely in W.
24 P 4 P 3
25 P 4 P 3 W is the red subgraph of P 4 P 3.
26 P 4 P 3 W is the red subgraph of P 4 P 3. W is not convex.
27 Notice that by definition, every Gi a convex. layer in G = G 1 G k is
28 Notice that by definition, every Gi a convex. layer in G = G 1 G k is G a 1 is the red subgraph.
29 Lemma (HPG) A subgraph W of G = G 1 G k is convex if and only if W = U 1 U k, where each U i is convex in G i.
30 Lemma (HPG) A subgraph W of G = G 1 G k is convex if and only if W = U 1 U k, where each U i is convex in G i. Really, we only need one direction of this lemma: convexity of W = W is a subproduct
31 Assume W is convex and V (W ) {green vertices}.
32 Assume W is convex and V (W ) {green vertices}.
33 Assume W is convex and V (W ) {green vertices}.
34 Assume W is convex and V (W ) {green vertices}.
35 Assume W is convex and V (W ) {green vertices}.
36 Assume W is convex and V (W ) {green vertices}.
37 Assume W is convex and V (W ) {green vertices}. W is a subproduct.
38 Theorem (Sabidussi (1960) and Vizing (1963)) Let φ be an isomorphism between the connected graphs G and H that are representable as Cartesian products G = G 1 G k H = H 1 H l of prime graphs. Then k = l and to any a V (G), there is a permutation π of {1,..., k} such that φ (Gi a) = Hφ(a) π(i) for 1 i k.
39 Proof Sketch Take layer G a i in G, which is a convex subgraph.
40 Proof Sketch Take layer Gi a in G, which is a convex subgraph. Then φ (Gi a ) is a convex subgraph of H.
41 Proof Sketch Take layer G a i Then φ (G a i in G, which is a convex subgraph. ) is a convex subgraph of H. So φ (G a i ) = U 1 U l.
42 Proof Sketch Take layer Gi a in G, which is a convex subgraph. Then φ (Gi a ) is a convex subgraph of H. So φ (G a i ) = U 1 U l. We know G i = G a i = φ (G a i ) are prime.
43 Proof Sketch Take layer Gi a in G, which is a convex subgraph. Then φ (Gi a ) is a convex subgraph of H. So φ (Gi a) = U 1 U l. We know G i = G a i = φ (G a i ) are prime. So U j = {b j } for all but one index, call it π(i).
44 Proof Sketch Take layer Gi a in G, which is a convex subgraph. Then φ (Gi a ) is a convex subgraph of H. So φ (Gi a) = U 1 U l. We know G i = G a i = φ (G a i ) are prime. So U j = {b j } for all but one index, call it π(i). φ (G a i ) = {b 1 } U π(i) {b l }
45 Proof Sketch Take layer Gi a in G, which is a convex subgraph. Then φ (Gi a ) is a convex subgraph of H. So φ (Gi a) = U 1 U l. We know G i = G a i = φ (G a i ) are prime. So U j = {b j } for all but one index, call it π(i). φ (G a i ) = {b 1 } U π(i) {b l } So φ (G a i ) Hφ(a) π(i).
46 Proof Sketch Take layer Gi a in G, which is a convex subgraph. Then φ (Gi a ) is a convex subgraph of H. So φ (Gi a) = U 1 U l. We know G i = G a i = φ (G a i ) are prime. So U j = {b j } for all but one index, call it π(i). φ (G a i ) = {b 1 } U π(i) {b l } So φ (G a i ) Hφ(a) π(i). The reverse argument shows φ (G a i ) = Hφ(a) π(i).
47 Hierarchical Product (2008)- Barrière, Dalfó, Fiol, and Mitjana introduced a new graph product, referred to as the generalized hierarchical product of graphs.
48 Hierarchical Product (2008)- Barrière, Dalfó, Fiol, and Mitjana introduced a new graph product, referred to as the generalized hierarchical product of graphs. Definition Given graphs G 1,..., G n and nonempty vertex subsets U i V (G i ) for 1 i n 1, the generalized hierarchical product, denoted G = G 1 (U 1 ) G n 1 (U n 1 ) G n, is the graph with vertex set V (G 1 ) V (G n ) and adjacencies (y 1, x 2,..., x n ) if x 1 y 1 E(G 1 ) (x 1,..., x n 1, x n ) (x 1, y 2, x 3,..., x n ) if x 2 y 2 E(G 2 ), x 1 U 1.. (x 1,..., x n 1, y n ) if x n y n E(G n ), x i U i, 1 i n 1.
49 Hierarchical Product Example w 2 v 2 u 2 u 1 v 1 w 1 x 1 Figure 5: P 4 (U 1 ) K 3 where U 1 = {v 1, w 1 }
50 Hierarchical Product We now wish to show that every connected graph has a unique prime factor decomposition with respect to the hierarchical product.
51 Hierarchical Product We now wish to show that every connected graph has a unique prime factor decomposition with respect to the hierarchical product. What part of the proof for the Cartesian product fails in the context of the hierarchical product?
52 Hierarchical Product We now wish to show that every connected graph has a unique prime factor decomposition with respect to the hierarchical product. What part of the proof for the Cartesian product fails in the context of the hierarchical product? convexity = subproduct
53 Hierarchical Product Example
54 Hierarchical Product Example W is the green subgraph of G = P 4 (U 1 ) P 3.
55 Hierarchical Product Example W is the green subgraph of G = P 4 (U 1 ) P 3. W is convex, but not a subproduct.
56 Hierarchical Product Solution
57 Hierarchical Product Solution Just change the definition of convexity...kind of.
58 Hierarchical Product Solution Just change the definition of convexity...kind of. Definition Let H be a subgraph of G = G 1 (U 1 ) G n 1 (U n 1 ) G n, and let G = G 1 G n. We say that H is hierarchically convex if given any two distinct vertices a and b of H and any shortest G -path P between a and b, each edge of P contained in G is also contained in H.
59 Hierarchical Product Example a: H 1 is not hierarchically convex b: H 2 is hierarchically convex Figure 7: P 3 (U 1 ) P 3 where V (P 3 ) = {0, 1, 2} and U 1 = {1, 2}
60 Hierarchical Product Lemma (Anderson and W.) If H is a subgraph of a hierarchical product G that is hierarchically convex, then H is a subproduct.
61 Hierarchical Product Theorem (Anderson and W.) Let φ be an isomorphism between the connected graphs G and H that are representable as hierarchical products G = G 1 (U 1 ) G n 1 (U n 1 ) G n, H = H 1 (W 1 ) H m 1 (W m 1 ) H m of prime graphs, where U i V (G i ) for i {1,..., n 1} and W j V (H j ) for j {1,..., m 1}. For any a = (a 1,..., a n ) V (G) where a i U i for 1 i n 1, there exists a permutation π of {1,..., n} such that φ(gi a) = Hφ(a) π(i) for 1 i n and m = n.
62 Hierarchical Product Proof Sketch Choose a = (a 1, a 2,..., a n ) V (G) such that a i U i for 1 i n 1.
63 Hierarchical Product Proof Sketch Choose a = (a 1, a 2,..., a n ) V (G) such that a i U i for 1 i n 1. For any j {1,..., n}, Gj a is a connected layer in G, which is hierarchically convex in G.
64 Hierarchical Product Proof Sketch Choose a = (a 1, a 2,..., a n ) V (G) such that a i U i for 1 i n 1. For any j {1,..., n}, Gj a is a connected layer in G, which is hierarchically ( ) convex in G. Then φ is hierarchically convex in H. G a j
65 Hierarchical Product Proof Sketch Choose a = (a 1, a 2,..., a n ) V (G) such that a i U i for 1 i n 1. For any j {1,..., n}, Gj a is a connected layer in G, which is hierarchically ( ) convex in G. Then φ Gj a is hierarchically convex in H. ( ) So φ = F 1 (V 1 ) F m 1 (V m 1 ) F m, where G a j F i H i for 1 i m and V i W i for 1 i m 1.
66 Hierarchical Product Proof Sketch Choose a = (a 1, a 2,..., a n ) V (G) such that a i U i for 1 i n 1. For any j {1,..., n}, Gj a is a connected layer in G, which is hierarchically ( ) convex in G. Then φ Gj a is hierarchically convex in H. ( ) So φ = F 1 (V 1 ) F m 1 (V m 1 ) F m, where G a j F i H i for 1 i m and ( V) i W i for 1 i m 1. We know G j = G a j = φ Gj a are prime.
67 Hierarchical Product Proof Sketch Choose a = (a 1, a 2,..., a n ) V (G) such that a i U i for 1 i n 1. For any j {1,..., n}, Gj a is a connected layer in G, which is hierarchically ( ) convex in G. Then φ Gj a is hierarchically convex in H. ( ) So φ = F 1 (V 1 ) F m 1 (V m 1 ) F m, where G a j F i H i for 1 i m and ( V) i W i for 1 i m 1. We know G j = G a j = φ Gj a are prime. So F k = {b k } for all but one index, call it π(j).
68 Hierarchical Product Proof Sketch Choose a = (a 1, a 2,..., a n ) V (G) such that a i U i for 1 i n 1. For any j {1,..., n}, Gj a is a connected layer in G, which is hierarchically ( ) convex in G. Then φ Gj a is hierarchically convex in H. ( ) So φ = F 1 (V 1 ) F m 1 (V m 1 ) F m, where G a j F i H i for 1 i m and ( V) i W i for 1 i m 1. We know G j = G a j = φ Gj a are prime. So( F k ) = {b k } for all but one index, call it π(j). φ = {b 1 } F π(j) (V π(j) ) {b m } G a j
69 Hierarchical Product Proof Sketch Choose a = (a 1, a 2,..., a n ) V (G) such that a i U i for 1 i n 1. For any j {1,..., n}, Gj a is a connected layer in G, which is hierarchically ( ) convex in G. Then φ Gj a is hierarchically convex in H. ( ) So φ = F 1 (V 1 ) F m 1 (V m 1 ) F m, where G a j F i H i for 1 i m and ( V) i W i for 1 i m 1. We know G j = G a j = φ Gj a are prime. So( F k ) = {b k } for all but one index, call it π(j). φ Gj a = {b 1 } F π(j) (V π(j) ) {b m } ( ) So φ Gj a H φ(a) π(j).
70 Hierarchical Product Proof Sketch Choose a = (a 1, a 2,..., a n ) V (G) such that a i U i for 1 i n 1. For any j {1,..., n}, Gj a is a connected layer in G, which is hierarchically ( ) convex in G. Then φ Gj a is hierarchically convex in H. ( ) So φ = F 1 (V 1 ) F m 1 (V m 1 ) F m, where G a j F i H i for 1 i m and ( V) i W i for 1 i m 1. We know G j = G a j = φ Gj a are prime. So( F k ) = {b k } for all but one index, call it π(j). φ Gj a = {b 1 } F π(j) (V π(j) ) {b m } ( ) So φ Gj a H φ(a) π(j).the reverse argument shows ( ) φ Gj a = H φ(a) π(j).
71 Hierarchical Product Additional Questions What information does this tell us about the Cartesian product?
72 Hierarchical Product Additional Questions What information does this tell us about the Cartesian product? What can be said about α(g 1 (U 1 ) G 2 )?
73 Hierarchical Product Additional Questions What information does this tell us about the Cartesian product? What can be said about α(g 1 (U 1 ) G 2 )? i(g 1 (U 1 ) G 2 )?
74 Hierarchical Product Additional Questions What information does this tell us about the Cartesian product? What can be said about α(g 1 (U 1 ) G 2 )? i(g 1 (U 1 ) G 2 )? ρ 2 (G 1 (U 1 ) G 2 )?
75 Hierarchical Product Additional Questions What information does this tell us about the Cartesian product? What can be said about α(g 1 (U 1 ) G 2 )? i(g 1 (U 1 ) G 2 )? ρ 2 (G 1 (U 1 ) G 2 )? Is there a polynomial time algorithm for finding the prime factors of a hierarchical product?
76 Hierarchical Product Additional Questions What information does this tell us about the Cartesian product? What can be said about α(g 1 (U 1 ) G 2 )? i(g 1 (U 1 ) G 2 )? ρ 2 (G 1 (U 1 ) G 2 )? Is there a polynomial time algorithm for finding the prime factors of a hierarchical product? Can you find γ(g 1 (U 1 ) G 2 )?
77 Hierarchical Product References R. Hammack, W. Imrich, and S. Klavžar. Handbook of product graphs. Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, FL, second edition, L. Barrière, C. Dalfó, M.A. Fiol, and M. Mitjana. The generalized hierarchical product of graphs. Discrete Math., 309(12): , V.G. Vizing. The Cartesian product of graphs (Russian). Vyčisl. Sistemy, 9, 30-43, English translation in Comp. El. Syst. 2: , G. Sabidussi. Graph Multiplication. Math. Zeitschr., 72: , 1960.
78 Hierarchical Product Thank you!
Prime Factorization and Domination in the Hierarchical Product of Graphs
Prime Factorization and Domination in the Hierarchical Product of Graphs S. E. Anderson 1, Y. Guo 2, A. Rubin 2 and K. Wash 2 1 Department of Mathematics, University of St. Thomas, St. Paul, MN 55105 2
More informationDistinguishing Cartesian powers of graphs
Distinguishing Cartesian powers of graphs Wilfried Imrich Sandi Klavžar Abstract The distinguishing number D(G) of a graph is the least integer d such that there is a d-labeling of the vertices of G that
More informationUNIQUE PRIME CARTESIAN FACTORIZATION OF GRAPHS OVER FINITE FIELDS
UNIQUE PRIME CARTESIAN FACTORIZATION OF GRAPHS OVER FINITE FIELDS RICHARD H. HAMMACK Abstract. A fundamental result, due to Sabidussi and Vizing, states that every connected graph has a unique pre factorization
More informationDISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 155 164 doi:10.7151/dmgt.1902 DISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS Ehsan Estaji Hakim Sabzevari University, Sabzevar, Iran e-mail: ehsan.estaji@hsu.ac.ir
More informationCartesian powers of graphs can be distinguished with two labels
Cartesian powers of graphs can be distinguished with two labels Sandi Klavžar Xuding Zhu Abstract The distinguishing number D(G) of a graph G is the least integer d such that there is a d-labeling of the
More informationDistribution of Global Defensive k-alliances over some Graph Products
Distribution of Global Defensive k-alliances over some Graph Products Mostafa Tavakoli a Sandi Klavžar b,c,d a Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of
More informationDistinguishing Cartesian Products of Countable Graphs
MATEMATYKA DYSKRETNA www.ii.uj.edu.pl/premd/ Ehsan ESTAJI, Wilfried IMRICH, Rafa l KALINOWSKI, Monika PILŚNIAK Distinguishing Cartesian Products of Countable Graphs Preprint Nr MD 079 (otrzymany dnia 1.09.2015)
More informationUniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs
Virginia Commonwealth University VCU Scholars Compass Theses and Dissertations Graduate School 2013 Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs Owen Puffenberger
More informationOn uniqueness of prime bipartite factors of graphs
On uniqueness of prime bipartite factors of graphs Richard H. Hammack Department of Mathematics and Applied Mathematics Virginia Commonwealth University Richmond, VA 23284, USA Abstract It has long been
More informationSome Properties on the Generalized Hierarchical Product of Graphs
Some Properties on the Generalized Hierarchical Product of Graphs Lali Barrière Cristina Dalfó Miquel Àngel Fiol Margarida Mitjana Universitat Politècnica de Catalunya July 23, 2008 Outline 1 The hierarchical
More informationDiscrete Mathematics
Discrete Mathematics 313 (2013) 1018 1027 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc On uniqueness of prime bipartite factors
More informationA prime factor theorem for bipartite graphs
A prime factor theorem for bipartite graphs Richard Hammack, Owen Puffenberger Department of Mathematics and Applied Mathematics Virginia Commonwealth University Richmond, VA 23284, USA Abstract It has
More informationRECOGNIZING WEIGHTED DIRECTED CARTESIAN GRAPH BUNDLES
Discussiones Mathematicae Graph Theory 20 (2000 ) 39 56 RECOGNIZING WEIGHTED DIRECTED CARTESIAN GRAPH BUNDLES Blaž Zmazek Department of Mathematics, PEF, University of Maribor Koroška 160, si-2000 Maribor,
More informationApplicable Analysis and Discrete Mathematics available online at ATOMS AND CLIQUE SEPARATORS IN GRAPH PRODUCTS
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.rs Appl. Anal. Discrete Math. x (xxxx), xxx xxx. doi:10.2298/aadmxxxxxxxx ATOMS AND CLIQUE SEPARATORS IN GRAPH PRODUCTS
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationIdentifying Codes and Domination in the Product of Graphs
Clemson University TigerPrints All Dissertations Dissertations 5-2014 Identifying Codes and Domination in the Product of Graphs Kirsti Wash Clemson University, kirstiw@clemson.edu Follow this and additional
More informationSmall Label Classes in 2-Distinguishing Labelings
Also available at http://amc.imfm.si ISSN 1855-3966 (printed ed.), ISSN 1855-3974 (electronic ed.) ARS MATHEMATICA CONTEMPORANEA 1 (2008) 154 164 Small Label Classes in 2-Distinguishing Labelings Debra
More informationDistinguishing Chromatic Number of Cartesian Products of Graphs
Graph Packing p.1/14 Distinguishing Chromatic Number of Cartesian Products of Graphs Hemanshu Kaul hkaul@math.uiuc.edu www.math.uiuc.edu/ hkaul/. University of Illinois at Urbana-Champaign Graph Packing
More informationPacking chromatic vertex-critical graphs
Packing chromatic vertex-critical graphs Sandi Klavžar a,b,c Douglas F. Rall d a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia b Faculty of Natural Sciences and Mathematics, University
More informationCartesian product of hypergraphs: properties and algorithms
Cartesian product of hypergraphs: properties and algorithms Alain Bretto alain.bretto@info.unicaen.fr Yannick Silvestre yannick.silvestre@info.unicaen.fr Thierry Vallée vallee@pps.jussieu.fr Université
More information(Approximate) Graph Products
(Approximate) Graph Products Marc Hellmuth Max Planck Institute for Mathematics in the Sciences Leipzig, Germany Bioinformatics Group Science Department of Computer Science, and Interdisciplinary Center
More informationEdge-counting vectors, Fibonacci cubes, and Fibonacci triangle
Publ. Math. Debrecen Manuscript (November 16, 2005) Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle By Sandi Klavžar and Iztok Peterin Abstract. Edge-counting vectors of subgraphs of Cartesian
More informationRecent Developments on the Structure of Cartesian Products of Graphs
Proc. ICDM 2008, RMS-Lecture Notes Series No. 13, 2010, pp. 171 177. Recent Developments on the Structure of Cartesian Products of Graphs Sandi Klavžar Faculty of Mathematics and Physics, University of
More informationRainbow domination in the lexicographic product of graphs
Rainbow domination in the lexicographic product of graphs Tadeja Kraner Šumenjak Douglas F. Rall Aleksandra Tepeh Abstract A k-rainbow dominating function of a graph G is a map f from V(G) to the set of
More informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 April 8, 2008 Outline 1 Introduction 2 Graphs and matrices
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationOn the difference between the revised Szeged index and the Wiener index
On the difference between the revised Szeged index and the Wiener index Sandi Klavžar a,b,c M J Nadjafi-Arani d June 3, 01 a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia sandiklavzar@fmfuni-ljsi
More informationOn the connectivity of the direct product of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 41 (2008), Pages 45 56 On the connectivity of the direct product of graphs Boštjan Brešar University of Maribor, FEECS Smetanova 17, 2000 Maribor Slovenia bostjan.bresar@uni-mb.si
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs L. Barrière F. Comellas C. Dalfó M.A. Fiol Departament de Matemàtica Aplicada IV, Universitat Politècnica de Catalunya Barcelona, Catalonia, Spain Abstract A new operation
More informationProblems in Domination and Graph Products
Clemson University TigerPrints All Dissertations Dissertations 5-2016 Problems in Domination and Graph Products Jason Todd Hedetniemi Clemson University, jason.hedetniemi@gmail.com Follow this and additional
More informationThe graph theory general position problem on some interconnection networks
The graph theory general position problem on some interconnection networks Paul Manuel a Sandi Klavžar b,c,d a Department of Information Science, College of Computing Science and Engineering, Kuwait University,
More informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 March 22, 2007 Outline 1 Introduction 2 The hierarchical
More informationOn k-rainbow independent domination in graphs
On k-rainbow independent domination in graphs Tadeja Kraner Šumenjak Douglas F. Rall Aleksandra Tepeh Abstract In this paper, we define a new domination invariant on a graph G, which coincides with the
More informationHanoi Graphs and Some Classical Numbers
Hanoi Graphs and Some Classical Numbers Sandi Klavžar Uroš Milutinović Ciril Petr Abstract The Hanoi graphs Hp n model the p-pegs n-discs Tower of Hanoi problem(s). It was previously known that Stirling
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
More informationk-degenerate Graphs Allan Bickle Date Western Michigan University
k-degenerate Graphs Western Michigan University Date Basics Denition The k-core of a graph G is the maximal induced subgraph H G such that δ (H) k. The core number of a vertex, C (v), is the largest value
More informationImproved Bounds for the Chromatic Number of the Lexicographic Product of Graphs
Improved Bounds for the Chromatic Number of the Lexicographic Product of Graphs Roland Kaschek University of Klagenfurt Department of Computer Science 9020 Klagenfurt, Austria Sandi Klavžar University
More informationON FIXING SETS OF COMPOSITION AND CORONA PRODUCTS OF GRAPHS
ON FIXING SETS OF COMPOSITION AND CORONA PRODUCTS OF GRAPHS I. JAVAID*, M. S. AASI, I. IRSHAD, M. SALMAN Abstract. A fixing set F of a graph G is a set of those vertices of the graph G which when assigned
More informationMa/CS 6b Class 12: Graphs and Matrices
Ma/CS 6b Class 2: Graphs and Matrices 3 3 v 5 v 4 v By Adam Sheffer Non-simple Graphs In this class we allow graphs to be nonsimple. We allow parallel edges, but not loops. Incidence Matrix Consider a
More informationChapter 34: NP-Completeness
Graph Algorithms - Spring 2011 Set 17. Lecturer: Huilan Chang Reference: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 2nd Edition, The MIT Press. Chapter 34: NP-Completeness 2. Polynomial-time
More informationOn Orthogonal Double Covers of Complete Bipartite Graphs by Disjoint Unions of Graph-Paths
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 3, March 2014, PP 281-288 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org On Orthogonal
More informationarxiv: v1 [math.co] 5 Oct 2018
Grundy dominating sequences on X-join product Graciela Nasini Pablo Torres arxiv:1810.02737v1 [math.co] 5 Oct 2018 Facultad de Ciencias Exactas, Ingeniería y Agrimensura, Universidad Nacional de Rosario
More informationCONNECTIVITY AND OTHER INVARIANTS OF GENERALIZED PRODUCTS OF GRAPHS
CONNECTIVITY AND OTHER INVARIANTS OF GENERALIZED PRODUCTS OF GRAPHS S.C. LÓPEZ AND F.A. MUNTANER-BATLE Abstract. Figueroa-Centeno et al. introduced the following product of digraphs: let D be a digraph
More informationarxiv: v1 [math.co] 14 May 2017
arxiv:70504954v [mathco] 4 May 207 Vizing-type bounds for graphs with induced subgraph restrictions Elliot Krop, Pritul Patel, and Gaspar Porta Abstract For any graphs G and H, we say that a bound is of
More informationOn the chromatic number of the lexicographic product and the Cartesian sum of graphs
On the chromatic number of the lexicographic product and the Cartesian sum of graphs Niko Čižek University of Maribor TF, Smetanova ulica 17 62000 Maribor, Slovenia Sandi Klavžar University of Maribor
More informationEndomorphism Breaking in Graphs
Endomorphism Breaking in Graphs Wilfried Imrich Montanuniversität Leoben, A-8700 Leoben, Austria imrich@unileoben.ac.at Rafa l Kalinowski AGH University of Science and Technology, al. Mickiewicza 30, 30-059
More informationarxiv: v4 [math.co] 12 Nov 2015
Distance preserving graphs and graph products M. H. Khalifeh a, Bruce E. Sagan a, Emad Zahedi a,b, a Department of Mathematics, Michigan State University, East Lansing, MI 48824-1027, U.S.A. b Department
More informationarxiv: v1 [math.co] 19 Aug 2016
THE EXCHANGE GRAPHS OF WEAKLY SEPARATED COLLECTIONS MEENA JAGADEESAN arxiv:1608.05723v1 [math.co] 19 Aug 2016 Abstract. Weakly separated collections arise in the cluster algebra derived from the Plücker
More informationRestrained Weakly Connected Independent Domination in the Corona and Composition of Graphs
Applied Mathematical Sciences, Vol. 9, 2015, no. 20, 973-978 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.4121046 Restrained Weakly Connected Independent Domination in the Corona and
More informationarxiv: v1 [math.co] 23 Oct 2016
arxiv:1610.07200v1 [math.co] 23 Oct 2016 Distinguishing number and distinguishing index of Kronecker product of two graphs Saeid Alikhani February 1, 2018 Samaneh Soltani Department of Mathematics, Yazd
More informationThe min cost flow problem Course notes for Search and Optimization Spring 2004
The min cost flow problem Course notes for Search and Optimization Spring 2004 Peter Bro Miltersen February 20, 2004 Version 1.3 1 Definition of the min cost flow problem We shall consider a generalization
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More information4 Packing T-joins and T-cuts
4 Packing T-joins and T-cuts Introduction Graft: A graft consists of a connected graph G = (V, E) with a distinguished subset T V where T is even. T-cut: A T -cut of G is an edge-cut C which separates
More informationThis article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the author s benefit and for the benefit of the author s institution, for non-commercial
More informationNOTES ON THE INDEPENDENCE NUMBER IN THE CARTESIAN PRODUCT OF GRAPHS
Discussiones Mathematicae Graph Theory xx (xxxx ) xxx xxx NOTES ON THE INDEPENDENCE NUMBER IN THE CARTESIAN PRODUCT OF GRAPHS G. Abay-Asmerom, R. Hammack, C.E. Larson and D.T. Taylor Department of Mathematics
More informationBetti Numbers of Splittable Graphs
Betti Numbers of Splittable Graphs Brittany Burns Dept. of Mathematical Sciences Shawnee State University, Portsmouth, OH 45662 USA Haley Mansfield Dept. of Mathematics Kansas State University, Manhattan,
More informationRepresentations of disjoint unions of complete graphs
Discrete Mathematics 307 (2007) 1191 1198 Note Representations of disjoint unions of complete graphs Anthony B. Evans Department of Mathematics and Statistics, Wright State University, Dayton, OH, USA
More informationAn Application of the permanent-determinant method: computing the Z-index of trees
Department of Mathematics wtrnumber2013-2 An Application of the permanent-determinant method: computing the Z-index of trees Daryl Deford March 2013 Postal address: Department of Mathematics, Washington
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS
ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS SIMON M. SMITH Abstract. If G is a group acting on a set Ω and α, β Ω, the digraph whose vertex set is Ω and whose arc set is the orbit (α, β)
More informationUNION OF DISTANCE MAGIC GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 239 249 doi:10.7151/dmgt.1932 UNION OF DISTANCE MAGIC GRAPHS Sylwia Cichacz 1 and Mateusz Nikodem 2 AGH University of Science and Technology e-mail: cichacz@agh.edu.pl
More informationDistinguishing infinite graphs
Distinguishing infinite graphs Wilfried Imrich Montanuniversität Leoben, A-8700 Leoben, Austria wilfried.imrich@uni-leoben.at Sandi Klavžar Department of Mathematics and Computer Science FNM, University
More informationA characterization of graphs by codes from their incidence matrices
A characterization of graphs by codes from their incidence matrices Peter Dankelmann Department of Mathematics University of Johannesburg P.O. Box 54 Auckland Park 006, South Africa Jennifer D. Key pdankelmann@uj.ac.za
More informationarxiv: v2 [math.co] 30 Jun 2013
A polynomial representation and a unique code of a simple undirected graph arxiv:1304.5847v2 [math.co] 30 Jun 2013 Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen Abstract In this note we introduce a representation
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationINDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 32 (2012) 5 17 INDEPENDENT TRANSVERSAL DOMINATION IN GRAPHS Ismail Sahul Hamid Department of Mathematics The Madura College Madurai, India e-mail: sahulmat@yahoo.co.in
More informationNOTES ON MATCHINGS IN CONVERGENT GRAPH SEQUENCES
NOTES ON MATCHINGS IN CONVERGENT GRAPH SEQUENCES HARRY RICHMAN Abstract. These are notes on the paper Matching in Benjamini-Schramm convergent graph sequences by M. Abért, P. Csikvári, P. Frenkel, and
More informationUsing Determining Sets to Distinguish Kneser Graphs
Using Determining Sets to Distinguish Kneser Graphs Michael O. Albertson Department of Mathematics and Statistics Smith College, Northampton MA 01063 albertson@math.smith.edu Debra L. Boutin Department
More informationGRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY. Hamid-Reza Fanaï
Opuscula Mathematica Vol. 30 No. 3 2010 http://dx.doi.org/10.7494/opmath.2010.30.3.271 GRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY Hamid-Reza Fanaï Abstract. In this paper, we give a sufficient condition
More informationDistinguishing infinite graphs
Distinguishing infinite graphs Wilfried Imrich Montanuniversität Leoben, A-8700 Leoben, Austria wilfried.imrich@mu-leoben.at Sandi Klavžar Department of Mathematics and Computer Science FNM, University
More informationAssociativity and Non-Associativity of Some Hypergraph Products
Math.Comput.Sci. DOI 10.1007/s11786-016-0276-y Mathematics in Computer Science Associativity and Non-Associativity of Some Hypergraph Products Richard H. Hammack Marc Hellmuth Lydia Ostermeier Peter F.
More informationLaplacian for Graphs Exercises 1.
Laplacian for Graphs Exercises 1. Instructor: Mednykh I. A. Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial Designs 20-24 January,
More informationLatin squares: Equivalents and equivalence
Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to
More informationMutually embeddable graphs and the Tree Alternative conjecture
Mutually embeddable graphs and the Tree Alternative conjecture Anthony Bonato a a Department of Mathematics Wilfrid Laurier University Waterloo, ON Canada, N2L 3C5 Claude Tardif b b Department of Mathematics
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
More informationOn DP-coloring of graphs and multigraphs
On DP-coloring of graphs and multigraphs Anton Bernshteyn Alexandr Kostochka Sergei Pron arxiv:1609.00763v1 [math.co] 2 Sep 2016 Abstract While solving a question on list coloring of planar graphs, Dvořák
More informationExplicit Construction of Small Folkman Graphs
Michael Spectral Graph Theory Final Presentation April 17, 2017 Notation Rado s Arrow Consider two graphs G and H. Then G (H) p is the statement that if the edges of G are p-colored, then there exists
More informationUNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA On d-graceful labelings Anita Pasotti Quaderni Elettronici del Seminario di Geometria Combinatoria 7E (Maggio 0) http://wwwmatuniromait/~combinat/quaderni Dipartimento
More informationConvex sets in lexicographic products of graphs
Convex sets in lexicographic products of graphs Bijo S Anand Department of Futures Studies, University of Kerala Trivandrum-695034, India bijos anand@yahoo.com Manoj Changat Department of Futures Studies,
More informationON THE EDGE COLORING OF GRAPH PRODUCTS
ON THE EDGE COLORING OF GRAPH PRODUCTS M. M. M. JARADAT Received 11 October 2004 The edge chromatic number of G is the minimum number of colors required to color the edges of G in such a way that no two
More informationTHE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2)
THE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2) S. EL-ZANATI, H. JORDON, G. SEELINGER, P. SISSOKHO, AND L. SPENCE 4520 MATHEMATICS DEPARTMENT ILLINOIS STATE UNIVERSITY NORMAL,
More informationErdős-Gallai-type results for the rainbow disconnection number of graphs
Erdős-Gallai-type results for the rainbow disconnection number of graphs Xuqing Bai 1, Xueliang Li 1, 1 Center for Combinatorics and LPMC arxiv:1901.0740v1 [math.co] 8 Jan 019 Nankai University, Tianjin
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
More informationarxiv: v1 [math.co] 15 Sep 2016
A Method for Computing the Edge-Hyper-Wiener Index of Partial Cubes and an Algorithm for Benzenoid Systems Niko Tratnik Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia arxiv:1609.0469v1
More informationBuilding Graphs from Colored Trees
Building Graphs from Colored Trees Rachel M. Esselstein CSUMB Department of Mathematics and Statistics 100 Campus Center Dr. Building 53 Seaside, CA 93955, U.S.A. resselstein@csumb.edu Peter Winkler Department
More informationAn Isomorphism Theorem for Graphs
Virginia Commonwealth University VCU Scholars Compass Theses and Dissertations Graduate School 2009 An Isomorphism Theorem for Graphs Laura Culp Virginia Commonwealth University Follow this and additional
More informationOn Pairs of Disjoint Dominating Sets in a Graph
International Journal of Mathematical Analysis Vol 10, 2016, no 13, 623-637 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma20166343 On Pairs of Disjoint Dominating Sets in a Graph Edward M Kiunisala
More informationSome hard families of parameterised counting problems
Some hard families of parameterised counting problems Mark Jerrum and Kitty Meeks School of Mathematical Sciences, Queen Mary University of London {m.jerrum,k.meeks}@qmul.ac.uk September 2014 Abstract
More informationA Creative Review on Integer Additive Set-Valued Graphs
A Creative Review on Integer Additive Set-Valued Graphs N. K. Sudev arxiv:1407.7208v2 [math.co] 30 Jan 2015 Department of Mathematics Vidya Academy of Science & Technology Thalakkottukara, Thrissur-680501,
More informationExact distance graphs of product graphs
Exact distance graphs of product graphs Boštjan Brešar a,b Nicolas Gastineau c Sandi Klavžar,a,b,d Olivier Togni c October 22, 2018 a Faculty of Natural Sciences and Mathematics, University of Maribor,
More informationThe Manhattan Product of Digraphs
Electronic Journal of Graph Theory and Applications 1 (1 (2013, 11 27 The Manhattan Product of Digraphs F. Comellas, C. Dalfó, M.A. Fiol Departament de Matemàtica Aplicada IV, Universitat Politècnica de
More informationThe min cost flow problem Course notes for Optimization Spring 2007
The min cost flow problem Course notes for Optimization Spring 2007 Peter Bro Miltersen February 7, 2007 Version 3.0 1 Definition of the min cost flow problem We shall consider a generalization of the
More informationThe Binding Number of Trees and K(1,3)-free Graphs
The Binding Number of Trees and K(1,3)-free Graphs Wayne Goddard 1 Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 Abstract The binding number of a graph G is defined
More informationTree-width and planar minors
Tree-width and planar minors Alexander Leaf and Paul Seymour 1 Princeton University, Princeton, NJ 08544 May 22, 2012; revised March 18, 2014 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research education use, including for instruction at the authors institution
More informationOn non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
More informationThe Reduction of Graph Families Closed under Contraction
The Reduction of Graph Families Closed under Contraction Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 November 24, 2004 Abstract Let S be a family of graphs. Suppose
More information