On the Randić index and Diameter of Chemical Graphs


 Joan Davis
 2 years ago
 Views:
Transcription
1 On the Rić index Diameter of Chemical Graphs Dragan Stevanović PMF, University of Niš, Niš, Serbia PINT, University of Primorska, Koper, Slovenia (Received January 4, 008) Abstract Using the AutoGraphiX system, Aouchiche, Hansen Zheng [] proposed a conjecture that the difference the ratio of the Rić index the diameter of a graph are minimum for paths. We prove this conjecture for chemical graphs. Introduction All graphs G = (V, E) will be finite, simple undirected, we follow the stard graphtheoretic terminology, which may be found, for example, in [9]. The degree the neighborhood of a vertex u V will be denoted by d u N u, respectively. The minimum the maximum degree of a graph G are denoted by δ G G, respectively. The diameter the radius of G will be denoted by D G r G, respectively. A chemical graph is a graph with 4. The Rić index Ra(G), also called the connectivity index, of a graph G = (V, E) was introduced by the chemist Milan Rić in 975 [8] as Ra G = uv E. While it was designed to measure the extent of branching of the carbonatom skeleton of saturated hydrocarbons, it was demonstrated that the Rić index is well correlated Supported by the research grant 4405G of the Serbian Ministry of Science Environmental Protection the research program P085 of the Slovenian Agency for Research.
2 with a variety of physicochemical properties of alkanes, such as boiling point, enthalpy of formation, surface areas solubility in water. For a comprehensive survey of the (mathematical) properties of Rić index, see the book [4]. A number of mathematical papers devoted to the Rić index deals with finding the extremal graphs having the minimum or the maximum Rić index, for example, [3, 4, 5, 9, 0,,, 3, 6, 7, 0,, ]. On the other h, Aouchiche, Hansen Zheng have studied in [, ] relations between the Rić index other graph invariants using the AutoGraphiX system [6]. One of the conjectures obtained is Conjecture ([]) For any connected graph on n 3 vertices with Rić index Ra diameter D, Ra D n + Ra D n 3 + = n + n, with equalities if only if G is the path P n. This conjecture is somewhat related to Conjecture of Graffiti [7, 8], its modified form proposed in [6] that for all connected graphs G except even paths Ra G r G. In particular, it was proven in [6] that for all trees T, Ra T r T 3, which may be used to approach (although not prove it) the second part of the above conjecture, since in trees either D T = r T or D T = r T. Still, Conjecture may be proved for trees using the result of Li Zhao [6] who described the trees attaining the minimum Rić index when the diameter of a tree is fixed. Theorem ([6]) Among all trees of order n with diameter D, (i) for D 3, Ra T D (n D) (n D + ) +, the equality holds if only if T is a comet CS(n, n D + ); (ii) for D 4 T = CS(n, n D + ), Ra T D 4 + (n D) (n D + ) +, the equality holds if only if T is a path of length D with n D pendent vertices attached to the same vertex of a path. The proof of Conjecture for trees is now a straightforward application of stard calculus techniques to identify the minimum of functions Ra T D T Ra T /D T when D T ranges from to n. Our main goal is to prove the Conjecture for chemical graphs. The starting step of our approach is the fact that a graph G with diameter D has to contain the path P D+ as an induced subgraph. Thus, we will be interested to study under what conditions the induced subgraph of G has smaller Rić index than G? This does not hold in general, not even for all trees. Consider, for example, a tree T in Fig. its vertex v: we have ( 6 = Ra T v > Ra T = 6 + )
3 Figure : The tree whose induced subgraph has larger Rić index. However, as it will turn out, the Rić index of a proper induced subgraph of a chemical graph G is always less than Ra G. This result will be the foundation of the proof of Conjecture for chemical graphs. Rić index of a vertexdeleted subgraph The main topic of this section is the following useful Lemma 3 If 4δ G G in a connected graph G = (V, E), then for any vertex u V Ra G u Ra G. The equality holds if only if u is adjacent to all vertices of G u, δ G = (n )/4, each component of G u is a (δ G )regular graph. Proof. Let δ = δ G = G. Fix the vertex u V let M u = V \ ({u} N u ) be the set of vertices that are not adjacent to u. Further, let N u denote the set of those vertices of N u which have degree greater than. Then Ra G = + v N du u d v while Ra G u = Therefore, v,w N u,vw E v,w N u,vw E +,w M u,vw E + (d v )(d w ) + +,w M u,vw E (d v )d w Ra G Ra G u = N u N u du + v N u v M u,w M u,vw E, v M u,w M u,vw E ().
4 + + v,w N u,vw E v N u,w M u,vw E (d v )(d w ). (d v )d w Let d v,nu d v,mu be the numbers of neighbors of v within N u M u, respectively. Obviously, d v,nu +d v,mu = d v, as the remaining neighbor u does not belong to N u M u. First, we have (d v )d dv w d w,w M u,vw E = ( ( v N u = < v N u dv ) dv w M u,vw E dw dv ) dv,m u (since d w δ) dv δ ( + ) dv d v dv,m u δ dv d v,mu d v d v,mu d v (d v ) dv,m u δ (as + x < x/) () dv (from δ ) (from d u ). Next, we get = = v,w N u,vw E v,w N u,vw E v,w N u,vw E (d v )(d w ) ( + d v + d w (d v )(d w ) v,w N u,vw E = v N u (d v ) d v + d w (d v )(d w ) ( ) (d v ) + (d w ) w N u,vw E (d v ) dv,n u dv δ d v,nu d v ) (3) (since d w δ) (4) dv (from δ ) (5)
5 v N u d v,nu d v (as d u ). (6) The first inequality + dv+dw dv+dw (d v )(d w ) (d v )(d w ) above is implied by the following chain of inequalities for positive x, y by setting x := d v y := d w : (x + y) 4x y (x + )(y + ) + x + y + + x + y + x + y. Now from () d v,nu + d v,mu = d v we get ( (x + y) = + x + y ) 4x y Ra G Ra G u N u N u + d v,mu du d v d v,nu d v 0. (7) Concerning the case of equality, note first that the equality in (7) may not hold if N u N u or if d v,mu 0 for at least one v N u, due to a strict inequality in (). Thus, as G is connected, a necessary condition for the equality in (7) is that M u =, i.e., that u is adjacent to all vertices of G u that δ G. In such case, equality holds in (7) if only if equality holds in each of (3) (6), which in turn holds if only if each component of G u is (δ )regular graph for δ = n. 4 Unfortunately, Lemma 3 cannot be generalized to arbitrary induced subgraphs of a graph G with 4δ G G. If we remove an arbitrary vertex u from G, then certainly G G u, but we cannot say anything about δ G u, which may prevent further application of Lemma 3. Namely, it is easy to construct examples of graphs G such that δ G u is either larger than, equal to or smaller than δ G. The situation becomes clearer if we work with chemical graphs: then it always holds that 4δ G 4 G, as we may freely ignore possible isolated vertices of G, since they have no influence on the Rić index whatsoever, take δ G to represent the minimum degree of nonisolated vertices. Further, notice that the connectedness in Lemma 3 is essentially used only to get a more elegant characterization of the case of equality. Thus, from Lemma 3 we easily obtain the following Lemma 4 If G is a chemical graph H its proper induced subgraph, then Ra H < Ra G. 3 The proof of Conjecture for chemical graphs Theorem 5 For any connected chemical graph G on n 3 vertices Ra G D G n + with equalities if only if G = P n. Ra G D G + n,
6 Proof. A connected graph G with diameter D G contains the path P DG + as its induced subgraph [9]. If P DG + = G, then D G = n the equality holds in both inequalities above. If P DG + is a proper induced subgraph of G, then from Lemma 4 Then from D G < n Ra G > Ra PDG + = D G +. Ra G D G > D G + > n + Ra G > D G/ + = D G D G + > D G + n. References [] M. Aouchiche, P. Hansen, M. Zheng, Variable Neighborhood Search for Extremal Graphs. 8. Conjectures Results about the Rić Index, MATCH Commun. Math. Comput. Chem. 56 (006), [] M. Aouchiche, P. Hansen, M. Zheng, Variable Neighborhood Search for Extremal Graphs. 9. Further Conjectures Results about the Rić Index, MATCH Commun. Math. Comput. Chem. 58 (007), [3] O. Araujo, J.A. de la Peña, The connectivity index of a weighted graph, Linear Algebra Appl. 83 (998), [4] B. Bollobás, P. Erdös, Graphs of extremal weights, Ars Combin. 50 (998), [5] G. Caporossi, I. Gutman, P. Hansen, L. Pavlović, Graphs with maximum connectivity index, Comput. Biol. Chem. 7 (003), [6] G. Caporossi, P. Hansen, Variable neighborhood search for extremal graphs.. The AutoGraphiX system, Discrete Math. (000), [7] S. Fajtlowicz, On conjectures of Graffiti, Discrete Math. 7 (988), 3 8. [8] S. Fajtlowicz, Written on the Wall, Version , regularly updated file accessible via from [9] J. Gao, M. Lu, On the Rić index of unicyclic graphs, MATCH Commun. Math. Comput. Chem. 53 (005), [0] I. Gutman, O. Araujo, D.A. Morales, Estimating the connectivity index of a saturated hydrocarbon, Indian J. Chem. 39 (000), [] I. Gutman, O. Miljković, Molecules with smallest connectivity indices, MATCH Commun. Math. Comput. Chem. 4 (000),
7 [] I. Gutman, O. Miljković, G. Caporossi, P. Hansen, Alkanes with small large Rić connectivity indices, Chem. Phys. Lett. 306 (999), [3] P. Hansen, H. Mélot, Variable neighborhood search for extremal graphs. 6. Analyzing bounds for the connectivity index, J. Chem. Inf. Comput. Sci. 43 (003), 4. [4] X. Li, I. Gutman, Mathematical Aspects of RićType Molecular Structure Descriptors, Mathematical Chemistry Monographs, No., Faculty of Science Mathematics, University of Kragujevac, Kragujevac, 006. [5] X. Li, Y. Shi, A Survey on the Rić Index, MATCH Commun. Math. Comput. Chem. 59 (008), [6] X. Li, H. Zhao, Trees with small Rić connectivity indices, MATCH Commun. Math. Comput. Chem. 5 (004), [7] L. Pavlović, I. Gutman, Graphs with extremal connectivity index, Novi Sad J. Math. 3 (00), [8] M. Rić, On characterization of molecular branching, J. Amer. Chem. Soc. 97 (975), [9] D.B. West, Introduction to Graph Theory, Second Edition, Prentice Hall, Upper Saddle River, NJ, USA, 00. [0] X. Wu, L. Zhang, The third minimal Rić index tree with k pendant vertices, MATCH Commun. Math. Comput. Chem. 58 (007), 3. [] P. Yu, An upper bound on the Rić index of trees, J. Math. Study 3 (998), 5 30 (in Chinese). [] L. Zhang, M. Lu, F. Tian, Maximum Rić index on trees with k pendent vertices, J. Math. Chem. 4 (007), 6 7.
Extremal Wiener Index of Trees with All Degrees Odd
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287292 ISSN 03406253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of
More informationOn Some Vertex Degree Based Graph Invariants
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (20) 723730 ISSN 03406253 On Some Vertex Degree Based Graph Invariants Batmend Horoldagva a and Ivan
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationTotal colorings of planar graphs with small maximum degree
Total colorings of planar graphs with small maximum degree Bing Wang 1,, JianLiang Wu, SiFeng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong
More informationYILUN SHANG. e λi. i=1
LOWER BOUNDS FOR THE ESTRADA INDEX OF GRAPHS YILUN SHANG Abstract. Let G be a graph with n vertices and λ 1,λ,...,λ n be its eigenvalues. The Estrada index of G is defined as EE(G = n eλ i. In this paper,
More informationMean RamseyTurán numbers
Mean RamseyTurán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρmean coloring of a graph is a coloring of the edges such that the average
More informationAn inequality for the group chromatic number of a graph
An inequality for the group chromatic number of a graph HongJian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics
More informationCacti with minimum, secondminimum, and thirdminimum Kirchhoff indices
MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 4758 (2010) Cacti with minimum, secondminimum, and thirdminimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang
More informationTricyclic biregular graphs whose energy exceeds the number of vertices
MATHEMATICAL COMMUNICATIONS 213 Math. Commun., Vol. 15, No. 1, pp. 213222 (2010) Tricyclic biregular graphs whose energy exceeds the number of vertices Snježana Majstorović 1,, Ivan Gutman 2 and Antoaneta
More informationAn inequality for the group chromatic number of a graph
Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph HongJian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,
More informationGRAPH THEORY LECTURE 4: TREES
GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection
More informationBOUNDARY EDGE DOMINATION IN GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 04874, ISSN (o) 04955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 19704 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDEBERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationThe Independence Number in Graphs of Maximum Degree Three
The Independence Number in Graphs of Maximum Degree Three Jochen Harant 1 Michael A. Henning 2 Dieter Rautenbach 1 and Ingo Schiermeyer 3 1 Institut für Mathematik, TU Ilmenau, Postfach 100565, D98684
More informationLabeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
More informationOn the independence number of graphs with maximum degree 3
On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs
More informationOn the kpath cover problem for cacti
On the kpath cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of HaifaORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationmost 4 Mirka Miller 1,2, Guillermo PinedaVillavicencio 3, The University of Newcastle Callaghan, NSW 2308, Australia University of West Bohemia
Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo PinedaVillavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle
More informationProduct irregularity strength of certain graphs
Also available at http://amc.imfm.si ISSN 18553966 (printed edn.), ISSN 18553974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer
More informationApproximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and HingFung Ting 2 1 College of Mathematics and Computer Science, Hebei University,
More informationTree sums and maximal connected Ispaces
Tree sums and maximal connected Ispaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and
More informationDegree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
More informationINFORMATION INEQUALITIES FOR GRAPHS
Symmetry: Culture and Science Vol. 19, No. 4, 269284, 2008 INFORMATION INEQUALITIES FOR GRAPHS Matthias Dehmer 1, Stephan Borgert 2 and Danail Bonchev 3 1 Address: Institute for Bioinformatics and Translational
More informationGRAPHS AND ZERODIVISORS. In an algebra class, one uses the zerofactor property to solve polynomial equations.
GRAPHS AND ZERODIVISORS M. AXTELL AND J. STICKLES In an algebra class, one uses the zerofactor property to solve polynomial equations. For example, consider the equation x 2 = x. Rewriting it as x (x
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 438 2013) 1393 1397 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Note on the
More informationarxiv:1203.1525v1 [math.co] 7 Mar 2012
Constructing subset partition graphs with strong adjacency and endpoint count properties Nicolai Hähnle haehnle@math.tuberlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined
More informationDegreeassociated reconstruction parameters of complete multipartite graphs and their complements
Degreeassociated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertexdeleted subgraphofagraphgisacard.
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
More information3. Eulerian and Hamiltonian Graphs
3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from
More informationLINEAR INEQUALITIES AMONG GRAPH INVARIANTS: USING GRAPHEDRON TO UNCOVER OPTIMAL RELATIONSHIPS
LINEAR INEQUALITIES AMONG GRAPH INVARIANTS: USING GRAPHEDRON TO UNCOVER OPTIMAL RELATIONSHIPS JULIE CHRISTOPHE, SOPHIE DEWEZ, JEANPAUL DOIGNON, SOUROUR ELLOUMI, GILLES FASBENDER, PHILIPPE GRÉGOIRE, DAVID
More informationOn Integer Additive SetIndexers of Graphs
On Integer Additive SetIndexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A setindexer of a graph G is an injective setvalued function f : V (G) 2 X such that
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationDistributed Computing over Communication Networks: Maximal Independent Set
Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationTools for parsimonious edgecolouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR201010
Tools for parsimonious edgecolouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR201010 Tools for parsimonious edgecolouring of graphs
More informationComputer Science Department. Technion  IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
 1  THREE TREEPATHS Avram Zehavi Alon Itai Computer Science Department Technion  IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
More informationThe positive minimum degree game on sparse graphs
The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University
More informationA Stronger Form of the Van den BergKesten Inequality
A Stronger Form of the Van den BergKesten Inequality Peter Winkler March 4, 2010 Abstract Let Q n := {0,1} n be the discrete hypercube with uniform probability distribution, and let A and B be two upevents
More informationLinear Inequalities among Graph Invariants: using GraPHedron to uncover optimal relationships
Linear Inequalities among Graph Invariants: using GraPHedron to uncover optimal relationships Julie Christophe Université Libre de Bruxelles, Belgium Sophie Dewez Université Libre de Bruxelles, Belgium
More informationZERODIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS
ZERODIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We
More informationSEMITOTAL AND TOTAL BLOCKCUTVERTEX GRAPH
CHAPTER 3 SEMITOTAL AND TOTAL BLOCKCUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like Bradius
More informationShortcut sets for plane Euclidean networks (Extended abstract) 1
Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,
More informationarxiv: v2 [math.co] 30 Nov 2015
PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out
More informationDivisor graphs have arbitrary order and size
Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G
More informationSpecial Classes of Divisor Cordial Graphs
International Mathematical Forum, Vol. 7,, no. 35, 737749 Special Classes of Divisor Cordial Graphs R. Varatharajan Department of Mathematics, Sri S.R.N.M. College Sattur  66 3, Tamil Nadu, India varatharajansrnm@gmail.com
More informationOdd induced subgraphs in graphs of maximum degree three
Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A longstanding
More informationEvery tree contains a large induced subgraph with all degrees odd
Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University
More informationFALSE ALARMS IN FAULTTOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem
Opuscula Mathematica Vol. 32 No. 4 2012 http://dx.doi.org/10.7494/opmath.2012.32.4.751 FALSE ALARMS IN FAULTTOLERANT DOMINATING SETS IN GRAPHS Mateusz Nikodem Abstract. We develop the problem of faulttolerant
More informationSmooth functions statistics
Smooth functions statistics V. I. rnold To describe the topological structure of a real smooth function one associates to it the graph, formed by the topological variety, whose points are the connected
More informationA 2factor in which each cycle has long length in clawfree graphs
A factor in which each cycle has long length in clawfree graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More informationNetwork (Tree) Topology Inference Based on Prüfer Sequence
Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationMinimum degree condition forcing complete graph immersion
Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139
More informationA MEASURE OF GLOBAL EFFICIENCY IN NETWORKS. Aysun Aytac 1, Betul Atay 2. Faculty of Science Ege University 35100, Bornova, Izmir, TURKEY
International Journal of Pure and Applied Mathematics Volume 03 No. 05, 670 ISSN: 38080 (printed version); ISSN: 343395 (online version) url: http://www.ijpam.eu doi: http://dx.doi.org/0.73/ijpam.v03i.5
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationCS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010
CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison GomoryHu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationCycles and cliqueminors in expanders
Cycles and cliqueminors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the nonnegative
More informationGraphical degree sequences and realizations
swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS  Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös
More informationOnline Ramsey numbers
Online Ramsey numbers David Conlon Abstract Consider the following game between two players, Builder and Painter Builder draws edges one at a time and Painter colours them, in either red or blue, as each
More informationFrans J.C.T. de Ruiter, Norman L. Biggs Applications of integer programming methods to cages
Frans J.C.T. de Ruiter, Norman L. Biggs Applications of integer programming methods to cages Article (Published version) (Refereed) Original citation: de Ruiter, Frans and Biggs, Norman (2015) Applications
More informationNetwork File Storage with Graceful Performance Degradation
Network File Storage with Graceful Performance Degradation ANXIAO (ANDREW) JIANG California Institute of Technology and JEHOSHUA BRUCK California Institute of Technology A file storage scheme is proposed
More informationHigh degree graphs contain largestar factors
High degree graphs contain largestar factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationCompetition Parameters of a Graph
AKCE J. Graphs. Combin., 4, No. 2 (2007), pp. 183190 Competition Parameters of a Graph Suk J. Seo Computer Science Department Middle Tennessee State University Murfreesboro, TN 37132, U.S.A Email: sseo@mtsu.edu
More informationUniform Multicommodity Flow through the Complete Graph with Random Edgecapacities
Combinatorics, Probability and Computing (2005) 00, 000 000. c 2005 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom Uniform Multicommodity Flow through the Complete
More informationOn an antiramsey type result
On an antiramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider antiramsey type results. For a given coloring of the kelement subsets of an nelement set X, where two kelement
More informationTriangle deletion. Ernie Croot. February 3, 2010
Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,
More information8. Matchings and Factors
8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,
More informationSeries Convergence Tests Math 122 Calculus III D Joyce, Fall 2012
Some series converge, some diverge. Series Convergence Tests Math 22 Calculus III D Joyce, Fall 202 Geometric series. We ve already looked at these. We know when a geometric series converges and what it
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationAn Approximation Algorithm for Bounded Degree Deletion
An Approximation Algorithm for Bounded Degree Deletion Tomáš Ebenlendr Petr Kolman Jiří Sgall Abstract Bounded Degree Deletion is the following generalization of Vertex Cover. Given an undirected graph
More informationKings in Tournaments. Yu Yibo, Di Junwei, Lin Min
Kings in Tournaments by Yu Yibo, i Junwei, Lin Min ABSTRACT. Landau, a mathematical biologist, showed in 1953 that any tournament T always contains a king. A king, however, may not exist. in the. resulting
More informationGraphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
More informationOn Pebbling Graphs by their Blocks
On Pebbling Graphs by their Blocks Dawn Curtis, Taylor Hines, Glenn Hurlbert, Tatiana Moyer Department of Mathematics and Statistics Arizona State University, Tempe, AZ 852871804 November 19, 2008 dawn.curtis@asu.edu
More informationGraph theoretic approach to analyze amino acid network
Int. J. Adv. Appl. Math. and Mech. 2(3) (2015) 3137 (ISSN: 23472529) Journal homepage: www.ijaamm.com International Journal of Advances in Applied Mathematics and Mechanics Graph theoretic approach to
More informationOn the crossing number of K m,n
On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known
More informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A klabeling of vertices of a graph G(V, E) is a function V [k].
More informationP. Jeyanthi and N. Angel Benseera
Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONEPOINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel
More informationDISTANCE MAGIC CARTESIAN PRODUCTS OF GRAPHS
1 2 Discussiones Mathematicae Graph Theory xx (xxxx) 1 9 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 DISTANCE MAGIC CARTESIAN PRODUCTS OF GRAPHS Christian Barrientos Department of Mathematics,
More informationRemoving even crossings
Removing even crossings Michael J. Pelsmajer a, Marcus Schaefer b, Daniel Štefankovič c a Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL 60616, USA b Department of Computer
More informationA threshold for the MakerBreaker clique game
A threshold for the MakerBreaker clique game Tobias Müller Miloš Stojaković October 7, 01 Abstract We study the MakerBreaker kclique game played on the edge set of the random graph G(n, p. In this game,
More informationA Study of Sufficient Conditions for Hamiltonian Cycles
DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph
More information0 0 such that f x L whenever x a
EpsilonDelta Definition of the Limit Few statements in elementary mathematics appear as cryptic as the one defining the limit of a function f() at the point = a, 0 0 such that f L whenever a Translation:
More informationBARROW S INEQUALITY AND SIGNED ANGLE BISECTORS. 1. Introduction
Journal of Mathematical Inequalities Volume 8, Number 3 (2014), 537 544 doi:10.7153/jmi0840 BARROW S INEQUALITY AND SIGNED ANGLE BISECTORS BNKO MALEŠEVIĆ AND MAJA PETROVIĆ (Communicated by J. Pečarić)
More informationRi and. i=1. S i N. and. R R i
The subset R of R n is a closed rectangle if there are n nonempty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an
More informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a kuniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationConductance, the Normalized Laplacian, and Cheeger s Inequality
Spectral Graph Theory Lecture 6 Conductance, the Normalized Laplacian, and Cheeger s Inequality Daniel A. Spielman September 21, 2015 Disclaimer These notes are not necessarily an accurate representation
More informationRemoving Even Crossings
EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,
More informationBalloons, CutEdges, Matchings, and Total Domination in Regular Graphs of Odd Degree
Balloons, CutEdges, Matchings, and Total Domination in Regular Graphs of Odd Degree Suil O, Douglas B. West November 9, 2008; revised June 2, 2009 Abstract A balloon in a graph G is a maximal 2edgeconnected
More informationON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER
Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group
More informationThe chromatic spectrum of mixed hypergraphs
The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex
More informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
More information22 Gutman and Cioslowski whereas for any bipartite graph X i = X n i+1, i =1; 2;...;n. Since hexagonal systems are bipartite graphs, we immediately de
PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série tome 42 (56), 1987, pp. 21 27 BOUNDS FOR THE NUMBER OF PERFECT MATCHINGS IN HEXAGONAL SYSTEMS Ivan Gutman and Jerzy Cioslowski Abstract. Upper bounds
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More information