Lecture 5 November 6, 2012
|
|
- Gloria Neal
- 5 years ago
- Views:
Transcription
1 Hypercbe problems Lectre 5 Noember 6, 2012 Lectrer: Petr Gregor Scribe by: Kryštof Měkta Updated: Noember 22, Partial cbes A sbgraph H of G is isometric if d H (, ) = d G (, ) for eery, V (H); that is, H preseres all distances from G. Clearly, eery isometric sbgraph is an indced sbgraph. To see that the conerse implication is not tre, consider a path P 4 in the cycle C 5. Figre 1: A path P 4 in the cycle C 5 is indced bt not isometric sbgraph. A graph G is a partial cbe if it has an isometric embedding into Q n for some n. That is, G is isomorphic to an isometric sbgraph of Q n for some n. The smallest sch n (if it eists) is the isometric dimesion of G, denoted by dim I (G). Obseration 1 dim I (T ) = n 1 for eery tree T on n ertices. dim I (C 2n ) = n for eery n 2, with isometric embedding sch that eery direction is sed eactly twice, on antipodal edges. Eamples of partial cbes: the Desarges graph, the permtahedron, benzenoid graphs, linear etension graphs, hyperplane arrangement graphs, Fibonacci cbes, see Figre 2. 2 Djokoić-Winkler relation Let G = (V, E) be a bipartite graph. For E let W = { V ; d(, ) < d(, )} and W = { V ; d(, ) < d(, )}. Since G is bipartite, W W is a partition of V. Obseration 2 All ertices on eery shortest -path are in W (that is, I(, ) W ) if W. The Djokoić-Winkler 1 relation, denoted by Θ, is defined as follows. Definition 3 eθf for edges e = and f if f joins a erte in W with a erte in W. 5-1
2 (a) (b) (c) (d) Figre 2: Eamples of partial cbes: (a) the Desarges graph (also known as the generalized Petersen graph P (10, 3) or the middle leel graph of Q 5 ), (b) the permtahedron of order 4 (also known as the trncated octahedron), (c) the linear etension graph of a (now secret) poset, (d) a benzenoid graph. From Obseration 2 we obtain the following. Obseration 4 For eery bipartite graph G, the relation Θ is refleie and symmetric, if edges e, f both belong to a same shortest path in G, then e Θf. To see that the relation Θ does not hae to be transitie, consider K 2,3 on Figre 3(b). 1 The definition gien here is de to Djokoić [8]. Winkler [17] defined another relation which in bipartite graphs coincides with this definition. Hence it is commonly called Djokoić-Winkler relation. 5-2
3 a) W W b) W f 2 W f f 1 Θ e e Figre 3: (a) a partition of V to W and W, (b) K 2,3 with eθf 1, eθf 2, bt f 1 Θf 2. 3 Characterization of partial cbes A set S V is cone if I(, ) S for eery, S where I(, ) is the interal between and. That is, with eery two ertices S contains eery shortest path between them. Theorem 5 (Djokoić [8], Winkler [17]) Let G = (V, E) be a connected graph. following statements are eqialent. The 1. G is a partial cbe, 2. G is bipartite and W, W are cone for eery E, 3. G is bipartite and Θ is transitie (and conseqently, an eqialence). Proof 1) 2) Let f : V V (Q n ) be an isometric embedding. The sbgraph f(g) of Q n is clearly bipartite which implies that G is bipartite. If E then clearly f() f() = e i for some i. Assme withot loss of generality that f() i = 0. Since f(g) is an isometric sbgraph of Q n and distances in Q n are measred by the Hamming distance it follows that f() i = 0 for eery W. A shortest path between f( 1 ), f( 2 ) for 1, 2 W clearly contains at most one edge of each direction. Ths, it does not contain any edge in the direction i and all ertices on the shortest path hae the i-th coordinate eqal to 0. This means that the shortest path between f( 1 ) and f( 2 ) stays in f(w ) so the same is tre for its preimage - the shortest path between 1, 2 W in G. 2) 3) Let ()Θ(y), say W and y W. Symmetry of Θ implies that W y and W y. We claim that W = W y. Sppose w W \ W y. Then is on a shortest w-path and w W y. The coneity of W y and the fact that w, W y imply that W y, a contradiction. The claim implies that Θ is transitie. 5-3
4 3) 1) We proe this implication by constrcting an isometric embedding f of G to Q n where n is the inde of Θ, i.e. n = E / Θ. Let e i = i i be a representatie of the i-th class of Θ. The embedding f : V (G) Z n 2 is defined as follows. f() i = { 0 if Wi i 1 if W i i Note that eθe if and only if f(e) and f(e ) are of the same direction in Q n. For distinct, y V a shortest y-path has edges from distinct Θ-classes which means that f() f(y), so f is injectie. By the same reason, f maps shortest paths from G to shortest paths in Q n. Ths, f is an isometric embedding. Note that from the proof it follows that dim I (G) is the inde of Θ. Since the relation Θ can be fond and tested for transitiity in a polynomial time, we obtain the following. Corollary 6 Partial cbes can be recognized in polynomial time. In fact, they can be recognized in O(mn) time and O(n 2 ) space where n = V and m = E [1]. 4 Median graphs A set of medians for a triple of ertices, y, z is defined by Med(, y, z) = I(, y) I(y, z) I(z, ). A graph G is a median graph if Med(, y, z) = 1 for eery, y, z V (G). That is, eery triple has a niqe median, which is then denoted by med(, y, z). The class of median graphs incldes all trees, grids, hypercbes (by the following proposition). We will see that median graphs are in some sense graphs between trees and hypercbes. They occr in many at first seemingly nrelated areas sch as the stdy of soltions of 2-SAT [10], stable configrations of nonepansie networks [10], stable matchings in the well-known stable roommate problem [7], median semilattices [4]. Proposition 7 Q n is a median graph for eery n 1 with med(, y, z) = maj(, y, z) where maj is the coordinate-wise majority fnction. Proof If two ertices agree in a coordinate, say i = y i, then eery m Med(, y, z) has m i = i = y i since m belongs to a shortest y-path, so m = maj(, y, z). On the other hand, if m = maj(, y, z) then i = y i implies m i = i = y i, so m lies on a shortest path between eery pair of ertices. Eery median graph is bipartite. Indeed, for a contradiction consider a shortest odd cycle with a erte antipodal to an edge yz. Then Med(, y, z) =. Theorem 8 Eery median graph G = (V, E) is a partial cbe. 5-4
5 W y W z P y m P 1 m P 2 z P 3 U U Figre 4: (a) The sets U and U, (b) a shortest -path P in U and adjacent ertices from U, (c) the shortest paths between and y, and, y and. Proof For E let U = { W has a neighbor in W } and similarly U. Claim 9 If U then eery shortest -path belongs to U (that is, I(, ) U ). Let z be a neighbor of on a shortest -path P, see Figre 4(b). Clearly, d(z, y) = 2 and d(z, ) = d(, ) = d(y, ). Then m = med(z, y, ) mst be a neighbor of z lying on a shortest y-path. Therefore z U. Then we contine this argment for the net erte z on P ntil we reach. Claim 10 U indces an isometric sbgraph. Let, y U and m = med(, y, ). Let P 1 be a shortest m-path, P 2 a shortest ym-path and P 3 a shortest m-path, see Figre 4(c). By Claim 4, P 1 P 3 and P 2 P 3 are in U which means that P 1 P 2 also lies in U (i.e. d U (, y) = d G (, y)). Therefore, W and similarly W are cone and we may apply Theorem 5. Not eery partial cbe is a median graph, see Figre 5. y y z z Figre 5: Two eamples of partial cbes that are not median graphs 5 Mlder s cone epansion Let G = (V, E) be a connected graph and S V be a cone set. The epanded graph G = ep(g, S) is obtained as follows: for eery erte in S add a copy and join and by an edge, 5-5
6 insert an edge between new ertices wheneer is an edge of S. The set of new ertices in denoted by S (a copy of S), see Figre 6. G S S Figre 6: The epansion procedre. Since a sbgraph of a median graph indced by a cone set is clearly median, by considering all cases for triples in G it can be shown that if G is a median graph, then G is also a median graph. Interestingly, eery median graph can be obtained by this procedre 2 starting from a single erte. This shows s a tree-like strctre of median graphs. Theorem 11 (Mlder [14]) A graph G is a median graph if and only if it can be obtained from a single erte by a seqence of cone epansions. For a proof we refer to [14]. Figre 7: Eamples of cone epansions. 6 Eler-type formla Recall that ertices and edges can be seen as 0-faces and 1-faces, respectiely. Ths the following relation can been regarded as an Eler-type formla. Theorem 12 (Škrekoski [16]) Let G be a median graph, k = dim I (G), and let q i be the nmber of sbcbes of dimension i in G. Then, ( 1) i q i = 1 and k = ( 1) i iq i. 2 Originally, the cone epansion is described in a more general way. Howeer, it can be shown that this simplified ersion sffices. 5-6
7 Proof Let G = ep(g, S), q i be the nmber of copies of Q i in G, qi S be the nmber of copies of Q i in S. From the epansion procedre, obsere that q i = q i + qs i + qi 1 S for eery i 0 (where we define q 1 S = 0). Then, ( 1) i q i = ( 1) i q i + ( 1) i qi S + ( 1) i+1 qi S = 1 (1) i 1 }{{} = 0 since q 1 S = 0 by indction for G. Frthermore, applying indction for G and (1) for S gies s k = k + 1 = ( 1) i iq i + ( 1) i q S i = = ( 1) i iq i ( 1) i (iqi S (i + 1)qi S ) = = ( 1) i iq i ( 1) i iq S i ( 1) i iqi 1 S = i 1 ( 1) i q i. 7 Open problems Problem 1 (Eppstein [9]) Find a nonplanar cbic partial cbe other than the Desarges graph. (Here, cbic means 3-reglar.) Conjectre 13 (Brešar et al. [5]) Eery cbic partial cbe is Hamiltonian. Problem 2 Characterize Hamiltonian partial cbes (median graphs). A partial cbe G = (V, E) is Θ-gracefl if there is a bijection f : V {0,..., V 1} sch that for eery e 1, e 2 E : where f () = f() f(). e 1 Θe 2 if and only if f (e 1 ) = f (e 2 ) Conjectre 14 (Brešar, Klažar [6]) Eery partial cbe is Θ-gracefl. Remark This conjectre implies the gracefl tree conjectre. 8 Notes Median graphs were first stdied by Aann [2], Nebeský [15], and independently by Mlder [14]. There is an etensie literatre on median graphs, see [3, 13] for sreys. A good starting reference is also the book 3 of Imrich and Klažar [12]. 3 The second edition [11] is already aailable. 5-7
8 References [1] Arenhammer, Hagaer, Recognizing binary Hamming graphs in O(n 2 log n) time, Math. Syst. Theory 28 (1995), [2] S. Aann, Metric ternary distribtie semi-lattices, Proc. Am. Math. Soc. 12 (1961), [3] H.-J. Bandelt, V. Chepoi, Metric graph theory and geometry: a srey, Contemp. Math. 453 (2008), [4] H.-J. Bandelt, J. Hedlíkoá, Median algebras, Discrete Math. 45 (1983), [5] B. Brešar, S. Klažar, A. Lipoec, B. Mohar, Cbic inflation, mirror graphs, reglar maps, and partial cbes, Eropean J. Combin. 25 (2004), [6] B. Brešar, S. Klažar, Θ-gracefl labelings of partial cbes, Discrete Math. 306 (2006), [7] C. Cheng, A. Lin, Stable roommates matchings, mirror posets, median graphs and the local/global medan phenomenon in stable matchings, SIAM J. Discrete Math. 25 (2011), [8] D. Djokoić, Distance presering sbgraphs of hypercbes, J. Combin. Theory Ser. B 14 (1973), [9] D. Eppstein, Cbic partial cbes from simplicial arrangements, Electron. J. Combin. 13 (2006), #R79. [10] T. Feder, Stable networks and prodct graphs, Mem. Amer. Math. Soc. 116 No.555 (1995), 223 pp. [11] R. Hammack, W. Imrich, S. Klažar, Handbook of Prodct Graphs, Second Edition, CRC Press, [12] W. Imrich, S. Klažar, Prodct graphs, strctre and recognition, Wiley, New York, [13] S. Klažar, H. M. Mlder, Median graphs: characterization, location theory and related strctres, J. Combin. Math. Combin. Compt. 30 (1999), [14] H. M. Mlder, The strctre of median graphs, Discrete Math. 24 (1978), [15] L. Nebeský, Median graphs, Comment. Math. Uni. Carolin. 12 (1971), [16] R. Škrekoski, Two relations for median graphs, Discrete Math. 226 (2001), [17] P. Winkler, Isometric embedding in prodcts of complete graphs, Discrete Appl. Math. 7 (1984),
Chords in Graphs. Department of Mathematics Texas State University-San Marcos San Marcos, TX Haidong Wu
AUSTRALASIAN JOURNAL OF COMBINATORICS Volme 32 (2005), Pages 117 124 Chords in Graphs Weizhen G Xingde Jia Department of Mathematics Texas State Uniersity-San Marcos San Marcos, TX 78666 Haidong W Department
More informationarxiv: v1 [math.co] 25 Sep 2016
arxi:1609.077891 [math.co] 25 Sep 2016 Total domination polynomial of graphs from primary sbgraphs Saeid Alikhani and Nasrin Jafari September 27, 2016 Department of Mathematics, Yazd Uniersity, 89195-741,
More informationRestricted cycle factors and arc-decompositions of digraphs. J. Bang-Jensen and C. J. Casselgren
Restricted cycle factors and arc-decompositions of digraphs J. Bang-Jensen and C. J. Casselgren REPORT No. 0, 0/04, spring ISSN 0-467X ISRN IML-R- -0-/4- -SE+spring Restricted cycle factors and arc-decompositions
More informationOn the tree cover number of a graph
On the tree cover nmber of a graph Chassidy Bozeman Minerva Catral Brendan Cook Oscar E. González Carolyn Reinhart Abstract Given a graph G, the tree cover nmber of the graph, denoted T (G), is the minimm
More informationGRAY CODES FAULTING MATCHINGS
Uniersity of Ljbljana Institte of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1000 Ljbljana, Sloenia Preprint series, Vol. 45 (2007), 1036 GRAY CODES FAULTING MATCHINGS Darko
More informationSimpler Testing for Two-page Book Embedding of Partitioned Graphs
Simpler Testing for Two-page Book Embedding of Partitioned Graphs Seok-Hee Hong 1 Hiroshi Nagamochi 2 1 School of Information Technologies, Uniersity of Sydney, seokhee.hong@sydney.ed.a 2 Department of
More informationGraphs and Networks Lecture 5. PageRank. Lecturer: Daniel A. Spielman September 20, 2007
Graphs and Networks Lectre 5 PageRank Lectrer: Daniel A. Spielman September 20, 2007 5.1 Intro to PageRank PageRank, the algorithm reportedly sed by Google, assigns a nmerical rank to eery web page. More
More informationDiscrete Applied Mathematics. The induced path function, monotonicity and betweenness
Discrete Applied Mathematics 158 (2010) 426 433 Contents lists available at ScienceDirect Discrete Applied Mathematics jornal homepage: www.elsevier.com/locate/dam The indced path fnction, monotonicity
More informationThe Brauer Manin obstruction
The Braer Manin obstrction Martin Bright 17 April 2008 1 Definitions Let X be a smooth, geometrically irredcible ariety oer a field k. Recall that the defining property of an Azmaya algebra A is that,
More informationarxiv: v1 [cs.dm] 27 Jun 2017 Darko Dimitrov a, Zhibin Du b, Carlos M. da Fonseca c,d
Forbidden branches in trees with minimal atom-bond connectiity index Agst 23, 2018 arxi:1706.086801 [cs.dm] 27 Jn 2017 Darko Dimitro a, Zhibin D b, Carlos M. da Fonseca c,d a Hochschle für Technik nd Wirtschaft
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 informationIN this paper we consider simple, finite, connected and
INTERNATIONAL JOURNAL OF MATHEMATICS AND SCIENTIFIC COMPUTING (ISSN: -5), VOL., NO., -Eqitable Labeling for Some Star and Bistar Related Graphs S.K. Vaidya and N.H. Shah Abstract In this paper we proe
More informationA Note on Arboricity of 2-edge-connected Cubic Graphs
Ξ44 Ξ6fi ψ ) 0 Vol.44, No.6 205ff. ADVANCES IN MATHEMATICS(CHINA) No., 205 A Note on Arboricity of 2-edge-connected Cbic Graphs HAO Rongxia,, LAI Hongjian 2, 3, LIU Haoyang 4 doi: 0.845/sxjz.204056b (.
More informationSpanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
Spanning Trees ith Many Leaes in Graphs ithot Diamonds and Blossoms Pal Bonsma Florian Zickfeld Technische Uniersität Berlin, Fachbereich Mathematik Str. des 7. Jni 36, 0623 Berlin, Germany {bonsma,zickfeld}@math.t-berlin.de
More informationG. Mahadevan 1 Selvam Avadayappan 2 V. G. Bhagavathi Ammal 3 T. Subramanian 4
G. Mahadean, Selam Aadaappan, V. G. Bhagaathi Ammal, T. Sbramanian / International Jornal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Isse 6, Noember- December
More informationarxiv: v1 [math.co] 10 Nov 2010
arxi:1011.5001 [math.co] 10 No 010 The Fractional Chromatic Nmber of Triangle-free Graphs with 3 Linyan L Xing Peng Noember 1, 010 Abstract Let G be any triangle-free graph with maximm degree 3. Staton
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 informationConnectivity and Menger s theorems
Connectiity and Menger s theorems We hae seen a measre of connectiity that is based on inlnerability to deletions (be it tcs or edges). There is another reasonable measre of connectiity based on the mltiplicity
More informationCubic graphs have bounded slope parameter
Cbic graphs have bonded slope parameter B. Keszegh, J. Pach, D. Pálvölgyi, and G. Tóth Agst 25, 2009 Abstract We show that every finite connected graph G with maximm degree three and with at least one
More informationOn oriented arc-coloring of subcubic graphs
On oriented arc-coloring of sbcbic graphs Alexandre Pinlo Alexandre.Pinlo@labri.fr LaBRI, Université Bordeax I, 351, Cors de la Libération, 33405 Talence, France Janary 17, 2006 Abstract. A homomorphism
More informationAxiomatizing the Cyclic Interval Calculus
Axiomatizing the Cyclic Interal Calcls Jean-François Condotta CRIL-CNRS Uniersité d Artois 62300 Lens (France) condotta@cril.ni-artois.fr Gérard Ligozat LIMSI-CNRS Uniersité de Paris-Sd 91403 Orsay (France)
More informationThe Minimal Estrada Index of Trees with Two Maximum Degree Vertices
MATCH Commnications in Mathematical and in Compter Chemistry MATCH Commn. Math. Compt. Chem. 64 (2010) 799-810 ISSN 0340-6253 The Minimal Estrada Index of Trees with Two Maximm Degree Vertices Jing Li
More informationVectors in Rn un. This definition of norm is an extension of the Pythagorean Theorem. Consider the vector u = (5, 8) in R 2
MATH 307 Vectors in Rn Dr. Neal, WKU Matrices of dimension 1 n can be thoght of as coordinates, or ectors, in n- dimensional space R n. We can perform special calclations on these ectors. In particlar,
More informationRESOLUTION OF INDECOMPOSABLE INTEGRAL FLOWS ON A SIGNED GRAPH
RESOLUTION OF INDECOMPOSABLE INTEGRAL FLOWS ON A SIGNED GRAPH BEIFANG CHEN, JUE WANG, AND THOMAS ZASLAVSKY Abstract. It is well-known that each nonnegative integral flow of a directed graph can be decomposed
More informationA generalized Alon-Boppana bound and weak Ramanujan graphs
A generalized Alon-Boppana bond and weak Ramanjan graphs Fan Chng Abstract A basic eigenvale bond de to Alon and Boppana holds only for reglar graphs. In this paper we give a generalized Alon-Boppana bond
More informationXihe Li, Ligong Wang and Shangyuan Zhang
Indian J. Pre Appl. Math., 49(1): 113-127, March 2018 c Indian National Science Academy DOI: 10.1007/s13226-018-0257-8 THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF SOME STRONGLY CONNECTED DIGRAPHS 1 Xihe
More informationLesson 81: The Cross Product of Vectors
Lesson 8: The Cross Prodct of Vectors IBHL - SANTOWSKI In this lesson yo will learn how to find the cross prodct of two ectors how to find an orthogonal ector to a plane defined by two ectors how to find
More informationA generalized Alon-Boppana bound and weak Ramanujan graphs
A generalized Alon-Boppana bond and weak Ramanjan graphs Fan Chng Department of Mathematics University of California, San Diego La Jolla, CA, U.S.A. fan@csd.ed Sbmitted: Feb 0, 206; Accepted: Jne 22, 206;
More informationLecture 3. (2) Last time: 3D space. The dot product. Dan Nichols January 30, 2018
Lectre 3 The dot prodct Dan Nichols nichols@math.mass.ed MATH 33, Spring 018 Uniersity of Massachsetts Janary 30, 018 () Last time: 3D space Right-hand rle, the three coordinate planes 3D coordinate system:
More informationTo pose an abstract computational problem on graphs that has a huge list of applications in web technologies
Talk Objectie Large Scale Graph Algorithms A Gide to Web Research: Lectre 2 Yry Lifshits Steklo Institte of Mathematics at St.Petersbrg To pose an abstract comptational problem on graphs that has a hge
More informationConditions for Approaching the Origin without Intersecting the x-axis in the Liénard Plane
Filomat 3:2 (27), 376 377 https://doi.org/.2298/fil7276a Pblished by Faclty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Conditions for Approaching
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 435 (2011) 2065 2076 Contents lists aailable at ScienceDirect Linear Algebra and its Applications jornal homepage: www.elseier.com/locate/laa On the Estrada and Laplacian
More informationON THE PERFORMANCE OF LOW
Monografías Matemáticas García de Galdeano, 77 86 (6) ON THE PERFORMANCE OF LOW STORAGE ADDITIVE RUNGE-KUTTA METHODS Inmaclada Higeras and Teo Roldán Abstract. Gien a differential system that inoles terms
More informationMinimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps
Minimizing Intra-Edge Crossings in Wiring Diagrams and Pblic Transportation Maps Marc Benkert 1, Martin Nöllenbrg 1, Takeaki Uno 2, and Alexander Wolff 1 1 Department of Compter Science, Karlsrhe Uniersity,
More informationA Note on Johnson, Minkoff and Phillips Algorithm for the Prize-Collecting Steiner Tree Problem
A Note on Johnson, Minkoff and Phillips Algorithm for the Prize-Collecting Steiner Tree Problem Palo Feofiloff Cristina G. Fernandes Carlos E. Ferreira José Coelho de Pina September 04 Abstract The primal-dal
More informationWorst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
OR Spectrm 06 38:53 540 DOI 0.007/s009-06-043-5 REGULAR ARTICLE Worst-case analysis of the LPT algorithm for single processor schedling with time restrictions Oliver ran Fan Chng Ron Graham Received: Janary
More informationUpper Bounds on the Spanning Ratio of Constrained Theta-Graphs
Upper Bonds on the Spanning Ratio of Constrained Theta-Graphs Prosenjit Bose and André van Renssen School of Compter Science, Carleton University, Ottaa, Canada. jit@scs.carleton.ca, andre@cg.scs.carleton.ca
More informationComplex Variables. For ECON 397 Macroeconometrics Steve Cunningham
Comple Variables For ECON 397 Macroeconometrics Steve Cnningham Open Disks or Neighborhoods Deinition. The set o all points which satis the ineqalit
More informationGeneralized Fibonacci cubes
Generalized Fibonacci cubes Aleksandar Ilić Faculty of Sciences and Mathematics University of Niš, Serbia e-mail: aleksandari@gmail.com Sandi Klavžar Faculty of Mathematics and Physics University of Ljubljana,
More informationTwo-ended regular median graphs
Two-ended regular median graphs Wilfried Imrich Montanuniversität Leoben, A-8700 Leoben, Austria wilfried.imrich@uni-leoben.at Sandi Klavžar Faculty of Mathematics and Physics, University of Ljubljana
More informationKey words. partially ordered sets, dimension, planar maps, planar graphs, convex polytopes
SIAM J. DISCRETE MATH. c 1997 Societ for Indstrial and Applied Mathematics Vol. 10, No. 4, pp. 515 528, Noember 1997 001 THE ORDER DIMENSION O PLANAR MAPS GRAHAM R. BRIGHTWELL AND WILLIAM T. TROTTER Abstract.
More informationComputing distance moments on graphs with transitive Djoković-Winkler s relation
omputing distance moments on graphs with transitive Djoković-Winkler s relation Sandi Klavžar Faculty of Mathematics and Physics University of Ljubljana, SI-000 Ljubljana, Slovenia and Faculty of Natural
More informationFaster exact computation of rspr distance
DOI 10.1007/s10878-013-9695-8 Faster exact comptation of rspr distance Zhi-Zhong Chen Ying Fan Lsheng Wang Springer Science+Bsiness Media New Yk 2013 Abstract De to hybridiation eents in eoltion, stdying
More informationWe automate the bivariate change-of-variables technique for bivariate continuous random variables with
INFORMS Jornal on Compting Vol. 4, No., Winter 0, pp. 9 ISSN 09-9856 (print) ISSN 56-558 (online) http://dx.doi.org/0.87/ijoc.046 0 INFORMS Atomating Biariate Transformations Jeff X. Yang, John H. Drew,
More informationThe Real Stabilizability Radius of the Multi-Link Inverted Pendulum
Proceedings of the 26 American Control Conference Minneapolis, Minnesota, USA, Jne 14-16, 26 WeC123 The Real Stabilizability Radis of the Mlti-Link Inerted Pendlm Simon Lam and Edward J Daison Abstract
More informationMinimal Obstructions for Partial Representations of Interval Graphs
Minimal Obstrctions for Partial Representations of Interal Graphs Pael Klaík Compter Science Institte Charles Uniersity in Prage Czech Repblic klaik@ik.mff.cni.cz Maria Samell Department of Theoretical
More informationc 2009 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol., No., pp. 8 86 c 009 Society for Indstrial and Applied Mathematics THE SURVIVING RATE OF A GRAPH FOR THE FIREFIGHTER PROBLEM CAI LEIZHEN AND WANG WEIFAN Abstract. We consider
More informationSubcritical bifurcation to innitely many rotating waves. Arnd Scheel. Freie Universitat Berlin. Arnimallee Berlin, Germany
Sbcritical bifrcation to innitely many rotating waves Arnd Scheel Institt fr Mathematik I Freie Universitat Berlin Arnimallee 2-6 14195 Berlin, Germany 1 Abstract We consider the eqation 00 + 1 r 0 k2
More informationTHE DIFFERENTIAL GEOMETRY OF REGULAR CURVES ON A REGULAR TIME-LIKE SURFACE
Dynamic Systems and Applications 24 2015 349-360 TH DIFFRNTIAL OMTRY OF RULAR CURVS ON A RULAR TIM-LIK SURFAC MIN OZYILMAZ AND YUSUF YAYLI Department of Mathematics ge Uniersity Bornoa Izmir 35100 Trkey
More informationOnline Stochastic Matching: New Algorithms and Bounds
Online Stochastic Matching: New Algorithms and Bonds Brian Brbach, Karthik A. Sankararaman, Araind Sriniasan, and Pan X Department of Compter Science, Uniersity of Maryland, College Park, MD 20742, USA
More informationEquivalence between transition systems. Modal logic and first order logic. In pictures: forth condition. Bisimilation. In pictures: back condition
odal logic and first order logic odal logic: local ie of the strctre ( here can I get by folloing links from here ). First order logic: global ie of the strctre (can see eerything, qantifiers do not follo
More informationGraphs and Their. Applications (6) K.M. Koh* F.M. Dong and E.G. Tay. 17 The Number of Spanning Trees
Graphs and Their Applications (6) by K.M. Koh* Department of Mathematics National University of Singapore, Singapore 1 ~ 7543 F.M. Dong and E.G. Tay Mathematics and Mathematics EdOOation National Institte
More informationDecoder Error Probability of MRD Codes
Decoder Error Probability of MRD Codes Maximilien Gadolea Department of Electrical and Compter Engineering Lehigh University Bethlehem, PA 18015 USA E-mail: magc@lehigh.ed Zhiyan Yan Department of Electrical
More informationA GAP PROGRAM FOR COMPUTING THE HOSOYA POLYNOMIAL AND WIENER INDEX OF NANO STRUCTURES
Digest Jornal of Nanomaterials and Biostrctres Vol, No, Jne 009, p 389 393 A GAP PROGRAM FOR COMPUTING THE HOSOYA POLYNOMIAL AND WIENER INDEX OF NANO STRUCTURES A R ASHRAFI, MODJTABA GHORBANI Institte
More informationApplications of Isometric Embeddings to Chemical Graphs
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Applications of Isometric Embeddings to Chemical Graphs Sandi Klavžar Abstract. Applications of isometric embeddings of benzenoid
More informationSpring, 2008 CIS 610. Advanced Geometric Methods in Computer Science Jean Gallier Homework 1, Corrected Version
Spring, 008 CIS 610 Adanced Geometric Methods in Compter Science Jean Gallier Homework 1, Corrected Version Febrary 18, 008; De March 5, 008 A problems are for practice only, and shold not be trned in.
More informationTHE CATEGORY OF CGWH SPACES
THE CATEGORY OF CGWH SPACES N. P. STRICKLAND It is ell-knon that the category U of compactly generated eak Hasdorff spaces is a conenient setting for homotopy theory and algebraic topology. In this paper
More informationLecture J. 10 Counting subgraphs Kirchhoff s Matrix-Tree Theorem.
Lecture J jacques@ucsd.edu Notation: Let [n] [n] := [n] 2. A weighted digraph is a function W : [n] 2 R. An arborescence is, loosely speaking, a digraph which consists in orienting eery edge of a rooted
More informationLecture 11: June 27. Distance Sensitivity Oracles. Succinct Graph Structures and Their Applications Spring Lecturer: Merav Parter
Sccinct Graph Strctres and Their Applications Spring 2018 Lectrer: Merav Parter Lectre 11: Jne 27 Distance Sensitivit Oracles A distance oracle scheme (Lectre 2) consists of two algorithms: a preprocessing
More informationThe median function on median graphs and semilattices
Discrete Applied Mathematics 101 (2000) 221 230 The median function on median graphs and semilattices F.R. McMorris a, H.M. Mulder b, R.C. Powers a; a Department of Applied Mathematics, Illinois Institute
More informationThe New (2+1)-Dimensional Integrable Coupling of the KdV Equation: Auto-Bäcklund Transformation and Non-Travelling Wave Profiles
MM Research Preprints, 36 3 MMRC, AMSS, Academia Sinica No. 3, December The New (+)-Dimensional Integrable Copling of the KdV Eqation: Ato-Bäcklnd Transformation and Non-Traelling Wae Profiles Zhena Yan
More informationDifferentiation of Exponential Functions
Differentiation of Eponential Fnctions The net derivative rles that o will learn involve eponential fnctions. An eponential fnction is a fnction in the form of a constant raised to a variable power. The
More informationComplexity of the Cover Polynomial
Complexity of the Coer Polynomial Marks Bläser and Holger Dell Comptational Complexity Grop Saarland Uniersity, Germany {mblaeser,hdell}@cs.ni-sb.de Abstract. The coer polynomial introdced by Chng and
More informationClassify by number of ports and examine the possible structures that result. Using only one-port elements, no more than two elements can be assembled.
Jnction elements in network models. Classify by nmber of ports and examine the possible strctres that reslt. Using only one-port elements, no more than two elements can be assembled. Combining two two-ports
More informationStudy on the Mathematic Model of Product Modular System Orienting the Modular Design
Natre and Science, 2(, 2004, Zhong, et al, Stdy on the Mathematic Model Stdy on the Mathematic Model of Prodct Modlar Orienting the Modlar Design Shisheng Zhong 1, Jiang Li 1, Jin Li 2, Lin Lin 1 (1. College
More informationDecoder Error Probability of MRD Codes
Decoder Error Probability of MRD Codes Maximilien Gadolea Department of Electrical and Compter Engineering Lehigh University Bethlehem, PA 18015 USA E-mail: magc@lehighed Zhiyan Yan Department of Electrical
More informationExercise 4. An optional time which is not a stopping time
M5MF6, EXERCICE SET 1 We shall here consider a gien filtered probability space Ω, F, P, spporting a standard rownian motion W t t, with natral filtration F t t. Exercise 1 Proe Proposition 1.1.3, Theorem
More informationChapter 6 Momentum Transfer in an External Laminar Boundary Layer
6. Similarit Soltions Chapter 6 Momentm Transfer in an Eternal Laminar Bondar Laer Consider a laminar incompressible bondar laer with constant properties. Assme the flow is stead and two-dimensional aligned
More informationNonlinear parametric optimization using cylindrical algebraic decomposition
Proceedings of the 44th IEEE Conference on Decision and Control, and the Eropean Control Conference 2005 Seville, Spain, December 12-15, 2005 TC08.5 Nonlinear parametric optimization sing cylindrical algebraic
More informationSign-reductions, p-adic valuations, binomial coefficients modulo p k and triangular symmetries
Sign-redctions, p-adic valations, binomial coefficients modlo p k and trianglar symmetries Mihai Prnesc Abstract According to a classical reslt of E. Kmmer, the p-adic valation v p applied to a binomial
More informationMATH2715: Statistical Methods
MATH275: Statistical Methods Exercises III (based on lectres 5-6, work week 4, hand in lectre Mon 23 Oct) ALL qestions cont towards the continos assessment for this modle. Q. If X has a niform distribtion
More informationCRITERIA FOR TOEPLITZ OPERATORS ON THE SPHERE. Jingbo Xia
CRITERIA FOR TOEPLITZ OPERATORS ON THE SPHERE Jingbo Xia Abstract. Let H 2 (S) be the Hardy space on the nit sphere S in C n. We show that a set of inner fnctions Λ is sfficient for the prpose of determining
More informationMAT389 Fall 2016, Problem Set 6
MAT389 Fall 016, Problem Set 6 Trigonometric and hperbolic fnctions 6.1 Show that e iz = cos z + i sin z for eer comple nmber z. Hint: start from the right-hand side and work or wa towards the left-hand
More informationSection 7.4: Integration of Rational Functions by Partial Fractions
Section 7.4: Integration of Rational Fnctions by Partial Fractions This is abot as complicated as it gets. The Method of Partial Fractions Ecept for a few very special cases, crrently we have no way to
More informationReaction-Diusion Systems with. 1-Homogeneous Non-linearity. Matthias Buger. Mathematisches Institut der Justus-Liebig-Universitat Gieen
Reaction-Dision Systems ith 1-Homogeneos Non-linearity Matthias Bger Mathematisches Institt der Jsts-Liebig-Uniersitat Gieen Arndtstrae 2, D-35392 Gieen, Germany Abstract We describe the dynamics of a
More informationThe Heat Equation and the Li-Yau Harnack Inequality
The Heat Eqation and the Li-Ya Harnack Ineqality Blake Hartley VIGRE Research Paper Abstract In this paper, we develop the necessary mathematics for nderstanding the Li-Ya Harnack ineqality. We begin with
More informationPartial Hamming graphs and expansion procedures
Discrete Mathematics 237 (2001) 13 27 www.elsevier.com/locate/disc Partial Hamming graphs and expansion procedures Bostjan Bresar Faculty of Agriculture, University of Maribor, Vrbanska 30, 2000 Maribor,
More informationLinear Strain Triangle and other types of 2D elements. By S. Ziaei Rad
Linear Strain Triangle and other tpes o D elements B S. Ziaei Rad Linear Strain Triangle (LST or T6 This element is also called qadratic trianglar element. Qadratic Trianglar Element Linear Strain Triangle
More informationGraph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation
Graph-Modeled Data Clstering: Fied-Parameter Algorithms for Cliqe Generation Jens Gramm Jiong Go Falk Hüffner Rolf Niedermeier Wilhelm-Schickard-Institt für Informatik, Universität Tübingen, Sand 13, D-72076
More informationACYCLIC WEAK CONVEX DOMINATION IN GRAPHS
International Journal of Mathematics & Engineering with Computers Vol 2, No -2, pp 65-72, January-December 20 ACYCLIC WEAK CONVEX DOMINATION IN GRAPHS TN Janakiraman, and PJA Alphonse ABSTRACT: In a graph
More informationAll Good (Bad) Words Consisting of 5 Blocks
Acta Mathematica Sinica, English Series Jun, 2017, Vol 33, No 6, pp 851 860 Published online: January 25, 2017 DOI: 101007/s10114-017-6134-2 Http://wwwActaMathcom Acta Mathematica Sinica, English Series
More informationPalindromes and local periodicity
Palindromes and local periodicity A. Blondin Massé, S. Brlek, A. Garon, S. Labbé Laboratoire de Combinatoire et d Informatiqe Mathématiqe, Uniersité d Qébec à Montréal, C. P. 8888 Sccrsale Centre-Ville,
More informationGradient Projection Anti-windup Scheme on Constrained Planar LTI Systems. Justin Teo and Jonathan P. How
1 Gradient Projection Anti-windp Scheme on Constrained Planar LTI Systems Jstin Teo and Jonathan P. How Technical Report ACL1 1 Aerospace Controls Laboratory Department of Aeronatics and Astronatics Massachsetts
More informationExistence of HCMU metrics on higher genus Riemann surfaces
Existence of HCMU metrics on higher gens Riemann srfaces October 4, 0 bstract We will generalize the reslt in [CCW05] and roe the existence of HCMU metrics on higher gens K-srfaces, i.e. Riemann srfaces
More informationA diagrammatic standardization theorem
Axiomatic Rewriting Theory I A diagrammatic standardization theorem Pal-André Melliès Sbmitted Jly 2005 By extending nondeterministic transition systems with concrrency and copy mechanisms, Axiomatic Rewriting
More informationZAGREB INDICES AND ZAGREB COINDICES OF SOME GRAPH OPERATIONS
International Jornal of Advanced Research in Engineering Technology (IJARET Volme 7, Isse 3, May Jne 06, pp 5 4, Article ID: IJARET_07_03_003 Available online at http://wwwiaemecom/ijaret/issesasp?jtype=ijaret&vtype=7&itype=3
More information6.4 VECTORS AND DOT PRODUCTS
458 Chapter 6 Additional Topics in Trigonometry 6.4 VECTORS AND DOT PRODUCTS What yo shold learn ind the dot prodct of two ectors and se the properties of the dot prodct. ind the angle between two ectors
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 informationMath 144 Activity #10 Applications of Vectors
144 p 1 Math 144 Actiity #10 Applications of Vectors In the last actiity, yo were introdced to ectors. In this actiity yo will look at some of the applications of ectors. Let the position ector = a, b
More informationMEAN VALUE ESTIMATES OF z Ω(n) WHEN z 2.
MEAN VALUE ESTIMATES OF z Ωn WHEN z 2 KIM, SUNGJIN 1 Introdction Let n i m pei i be the prime factorization of n We denote Ωn by i m e i Then, for any fixed complex nmber z, we obtain a completely mltiplicative
More informationRight Trapezoid Cover for Triangles of Perimeter Two
Kasetsart J (Nat Sci) 45 : 75-7 (0) Right Trapezoid Cover for Triangles of Perimeter Two Banyat Sroysang ABSTRACT A convex region covers a family of arcs if it contains a congrent copy of every arc in
More informationAn Explicit Lower Bound of 5n o(n) for Boolean Circuits
An Eplicit Lower Bound of 5n o(n) for Boolean Circuits Kazuo Iwama, Oded Lachish, Hiroki Morizumi, and Ran Raz Graduate School of Informatics, Kyoto Uniersity, Kyoto, JAPAN {iwama, morizumi}@kuis.kyoto-u.ac.jp
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 informationSUBJECT:ENGINEERING MATHEMATICS-I SUBJECT CODE :SMT1101 UNIT III FUNCTIONS OF SEVERAL VARIABLES. Jacobians
SUBJECT:ENGINEERING MATHEMATICS-I SUBJECT CODE :SMT0 UNIT III FUNCTIONS OF SEVERAL VARIABLES Jacobians Changing ariable is something e come across er oten in Integration There are man reasons or changing
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 informationAMS 212B Perturbation Methods Lecture 05 Copyright by Hongyun Wang, UCSC
AMS B Pertrbation Methods Lectre 5 Copright b Hongn Wang, UCSC Recap: we discssed bondar laer of ODE Oter epansion Inner epansion Matching: ) Prandtl s matching ) Matching b an intermediate variable (Skip
More informationEE2 Mathematics : Functions of Multiple Variables
EE2 Mathematics : Fnctions of Mltiple Variables http://www2.imperial.ac.k/ nsjones These notes are not identical word-for-word with m lectres which will be gien on the blackboard. Some of these notes ma
More informationLecture Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lectre Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2 Prepared by, Dr. Sbhend Kmar Rath, BPUT, Odisha. Tring Machine- Miscellany UNIT 2 TURING MACHINE
More information3.4-Miscellaneous Equations
.-Miscellaneos Eqations Factoring Higher Degree Polynomials: Many higher degree polynomials can be solved by factoring. Of particlar vale is the method of factoring by groping, however all types of factoring
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 information