Communicated by Alireza Abdollahi. 1. Introduction. For a set S V, the open neighborhood of S is N(S) = v S
|
|
- Evelyn Fleming
- 6 years ago
- Views:
Transcription
1 Transactions on Combinatorics ISSN print: , ISSN on-line: Vol. 01 No , pp c 2012 University of Isfahan ON THE VALUES OF INDEPENDENCE AND DOMINATION POLYNOMIALS AT SPECIFIC POINTS S. ALIKHANI AND M. H. REYHANI Communicated by Alireza Abdollahi Abstract. Let G be a simple graph of order n. We consider the independence polynomial and the domination polynomial of a graph G. The value of a graph polynomial at a specific point can give sometimes a very surprising information about the structure of the graph. In this paper we investigate independence and domination polynomial at 1 and Introduction Let G = V, E be a simple graph. For any vertex v V, the open neighborhood of v is the set Nv = {u V uv E} and the closed neighborhood is the set N[v] = Nv {v}. For a set S V, the open neighborhood of S is NS = v S Nv and the closed neighborhood of S is N[S] = NS S. The corona of two graphs G 1 and G 2, as defined by Frucht and Harary in [12], is the graph G = G 1 G 2 formed from one copy of G 1 and V G 1 copies of G 2, where the ith vertex of G 1 is adjacent to every vertex in the ith copy of G 2. The corona G K 1, in particular, is the graph constructed from a copy of G, where for each vertex v V G, a new vertex v and a pendant edge vv are added. The join of two graphs G 1 and G 2, denoted by G 1 + G 2 is a graph with vertex set V G 1 V G 2 and edge set EG 1 EG 2 {uv u V G 1 and v V G 2 }. Graph polynomials are a well-developed area useful for analyzing properties of graphs. The value of a graph polynomial at a specific point can give sometimes a very surprising information about the structure of the graph. Balister, et al. in [9] proved that for any graph G, qg, 1 is always a power MSC2010: Primary: 05C60 ; Secondary: 05C31. Keywords: Independence polynomial; Domination polynomial; Value. Received: 11 June 2012, Accepted: 16 July Corresponding author. 49
2 50 S. Alikhani and M. H. Reyhani of 2, where qg, x is interlace polynomial of a graph G. Stanley in [14] proved that 1 n P G, 1 is the number of acyclic orientations of G, where P G, λ is the chromatic polynomial of G and n = V G. In this paper we study independence and domination polynomial of a graph at 1 and 1. For convenience, the definition of the independence and domination polynomial of a graph will be given in the next sections. We denote the path of order n, the cycle of order n, and the wheel of order n, by P n, C n, and W n, respectively. 2. The independence polynomial of a graph at 1 and 1 An independent set of a graph G is a set of vertices where no two vertices are adjacent. The independence number is the size of a maximum independent set in the graph and denoted by αg. For a graph G, let i k denote the number of independent sets of cardinality k in G k = 0, 1,..., α. The independence polynomial of G, α IG, x = i k x k, is the generating polynomial for the independent sequence i 0, i 1, i 2,..., i α. IG; 1 = i 0 + i 1 + i i α equals the number of independent sets of G, and IG; 1 = i 0 i 1 + i α i α = f 0 G f 1 G, where f 0 G = i 0 + i 2 + i , f 1 G = i 1 + i 3 + i are equal to the numbers of independent sets of even size and odd size of G, respectively. IG; 1 is known as the alternating number of independent sets. We need the following theorem: Theorem 2.1. [13] If w V G and uv EG, then the following equalities hold: i IG; x = IG w; x + xig N[w]; x, ii IG; x = IG uv; x x 2 IG Nu Nv; x. A vertex v is pendant if its neighborhood contains only one vertex; an edge e = uv is pendant if one of its endpoints is a pendant vertex. Theorem 2.2. If u V G is a pendant vertex of G and v Nu, then IG; 1 = IG N[v]; 1. Proof. Since u V G is a pendant vertex of G and v Nu, Theorem 2.1 assures that IG; x = IG v; x + xig N[v]; x = 1 + xig {u, v}; x + xig N[v]; x. Therefore IG; 1 = IG N[v]; 1. k=0
3 Graph polynomial at 1 and 1 51 Theorem 2.3. For n 1, the following hold: i IP 3n 2, 1 = 0 and IP 3n 1, 1 = IP 3n, 1 = 1 n ; ii IC 3n, 1 = 2 1 n, IC 3n+1, 1 = 1 n and IC 3n+2, 1 = 1 n+1 ; iii IW 3n+1, 1 = 2 1 n 1 and IW 3n, 1 = IW 3n+2, 1 = 1 n 1. Proof. i We prove by induction on n. For n = 1, since IP 1, x = 1 + x, IP 2, x = 1 + 2x and IP 3, x = 1 + 3x + x 2, we have IP 1, 1 = 0 and IP 2, 1 = IP 3, 1 = 1. Suppose that the result is true for any k 3n. By Theorem 2.1i, IP k+1, x = IP k, x + xip k 1, x, therefore IP 3n+1, 1 = IP 3n, 1 IP 3n 1, 1 = 1 n 1 n = 0; IP 3n+2, 1 = IP 3n+1, 1 IP 3n, 1 = 0 1 n = 1 n+1 ; IP 3n+3, 1 = IP 3n+2, 1 IP 3n+1, 1 = 1 n+1 0 = 1 n+1 ii Since IC 3, x = 1 + 3x, IC 4, x = 1 + 4x + 2x 2, IC 5, x = 1 + 5x + 5x 2 and IC 6, x = 1 + 6x + 9x 2 + 2x 3, we have IC 3, 1 = 2 1, IC 4, 1 = 1 and IC 5, 1 = 1 2. By Theorem 2.1 and Part i, IC n, x = IP n 1, x + xip n 3, x. Therefore IC n, 1 = IP n 1, 1 IP n 3, 1. Now it is easy to see that IC 3k, 1 = 2 1 k, IC 3k+1, 1 = 1 k and IC 3k+2, 1 = 1 k+1. iii By Theorem 2.1i, IW n, x = IC n 1, x + x. Now by part ii we have the result. In the following theorem we compute the number of independent sets of paths, cycles and wheels: Theorem 2.4. i For any positive integer n, ii For any integer n 3, iii For any integer n 4, IP n, 1 = n cos 2 sπ. n + 2 n 2 IC n, 1 = cos 2 s 1 2 π. n IW n, 1 = 1 + n cos 2 s 1 2 π n 1 Proof. We know that see [8], IP n, x = n+1 n 2 2x x cos the results. 2s 1π n 2 and IW n, x = IC n 1, x + x.. 2x x cos 2sπ n+2, IC n, x = By substituting x = 1, we have
4 52 S. Alikhani and M. H. Reyhani We recall the following theorem: Theorem 2.5. [3, 11] If G has t connected components G 1,..., G t, then IG, x = t i=1 IG i, x. Theorem 2.6. For any tree T, IT ; 1 { 1, 0, 1}, i.e., the number of independent sets of even size varies by at most one from the number of independent sets of odd size. Proof. By induction on n = V T. It is not hard to see that for any tree with order 1, 2, 3, 4, 5 we have the result. Now suppose that V T = n + 1 5, v is a pendant vertex of T, Nv = {u} and T 1, T 2,..., T k are the trees of the forest T N[u]. According to Theorem 2.1ii, we have: IT ; x = IT uv; x x 2 IT Nu Nv; x = 1 + xit v; x x 2 IT N[u]; x = 1 + xit v; x x 2 IT 1 ; xit 2 ; x... IT k ; x Therefore IT ; 1 = IT 1 ; 1IT 2 ; 1... IT k ; 1 { 1, 0, 1}, since every tree T i has less than n vertices, by the induction hypothesis, IT i ; 1 { 1, 0, 1}. Theorem 2.7. If F is a forest, then IF ; 1 { 1, 0, 1}. Proof. If T 1, T 2,..., T k, k 1, are the connected components of F, then IF ; x = IT 1 ; xit 2 ; x... IT k ; x, because F = T 1 T 2... T k. Now, the conclusions follow from Theorem 2.6. Theorem 2.8. [3, 11] IG 1 + G 2 ; x = IG 1 ; x + IG 2 ; x 1. Theorem 2.9. For any integer k there is some connected graph G such that IG; 1 = k. Proof. First suppose that k is a negative integer. It is easy to check that IK a,a,...,a, x = n1 + x a a 1, and therefore IK a,a,...,a, 1 = 1 a i.e., for any negative integer k there is some connected graph G such that IG; 1 = k. Now suppose that k is a positive integer. Let G i, 1 i k, be k graphs with IG i ; 1 = 2 for every i {1, 2,..., k} for example we can put G i = C 6 for every i {1, 2,..., k} and H = G 1 + G G k. Then IH, x = IG 1, x + IG 2, x IG k, x k 1 and consequently IH, 1 = k + 1. The case of k = 0 follows from Theorem 2.6.
5 Graph polynomial at 1 and The domination polynomial at 1 and 1 A set S V is a dominating set if N[S] = V, or equivalently, every vertex in V \S is adjacent to at least one vertex in S. An i-subset of V G is a subset of V G of cardinality i. Let DG, i be the family of dominating sets of G which are i-subsets and let dg, i = DG, i. The polynomial V G DG, x = dg, ix i is defined as domination polynomial of G [1, 4, 5]. Every root of DG, x i=1 is called a domination root of G. The set of all roots of DG, x is denoted by ZDG, x. Let A B V. Define D A,B G, i as follows D A,B G, i = {S DG, i S B = A}. Let d A,B G, i = D A,B G, i and define D A,B G, x = V i=1 d A,BG, ix i. We shall consider the value of domination polynomial at 1 and 1. Note that DG; 1 = dg, 1 + dg, dg, n equals the number of dominating sets of G, and DG; 1 = dg, 1 + dg, 2 dg, n dg, n = g 0 G g 1 G, where g 0 G = dg, 2 + dg, 4 + dg, , g 1 G = dg, 1 + dg, 3 + dg, are equal to the numbers of dominating sets of even size and odd size of G, respectively. We call DG; 1 as the alternating number of dominating sets. The following theorem gives the value of domination polynomial of complete graphs, complete bipartite graphs and stars at 1 and 1: Theorem 3.1. i DK n, 1 = 1, DK m,n, 1 {±1, 3} and DK 1,n, 1 { 1, 1}. ii DK n, 1 = DK 1,n, 1 = 2 n + 1 and DK m,n, 1 = 2 m 12 n Proof. The results follow easily from DK n, x = 1 + x n + 1 and DK m,n, x = 1 + x m 11 + x n 1 + x m + x n see [4]. Theorem 3.2. Let G be a graph. If G has a vertex v of degree k such that N[v] is a clique, then DG, x = xdg N[v], x x D A,Nv G v, x. =A Nv where N 2,..., N 2 k are all nonempty subsets of Nv. Moreover, DG, 1 = DG N[v], 1. Proof. Suppose that Nv = {v 1,..., v k }. Let N 1 = Ø, N 2,..., N 2 k be all subsets of Nv. Let A be a dominating set of G with cardinality i. We have the following cases: 1 v A and A Nv = N 1, then A {v} is a dominating set of G N[v] with cardinality i 1. 2 v A and there exists an index t, 2 t 2 k such that A Nv = N t. Since N[v] is a clique, A {v} is a dominating set of G v with cardinality i 1 and A {v} Nv = N t. 3 v / A. Therefore A Nv Ø and there exists an index l, 2 l 2 k such that A Nv = N l. Therefore A is a dominating set of G v with cardinality i and A Nv = N l.
6 54 S. Alikhani and M. H. Reyhani By considering the above cases we obtain that dg, i = dg N[v], i 1 + Therefore we have 2 k r=2 d Nr,NvG v, i 1 + DG, x = xdg N[v], x x Now, by putting x = 1 in the above equality the proof is complete. 2 k r=2 2 k r=2 D Nr,NvG v, x. d Nr,NvG v, i. As a consequence of the previous theorem we determine the exact value of the domination polynomial of a forest at 1. We recall the following theorem: Theorem 3.3. [4] If G has t connected components G 1,..., G t, then DG, x = t i=1 DG i, x. Theorem 3.4. Let F be a forest. Then DF, 1 = 1 αf. Proof. By Theorem 3.3 it is sufficient to prove the theorem for trees. We prove this theorem by induction on n, where n is the order of tree T. For n = 1, 2 there is nothing to prove. Now, Let n 3. Let u 0 be an arbitrary vertex of T. Assume that w is a vertex with maximum distance of u 0. Clearly dw=1. Let vw ET. Obviously, at most one of the neighbors of v has degree more than one. Since n 3, then dv 2. Assume that dv = t and {u 1,..., u t 1 } Nv and du i =1, for i = 1,..., t 1. Let H = T {v, u 1,..., u t 1 }. Clearly, H is a tree and αt = αh + t 1. Now, By Theorems 3.3 and 3.2 and induction hypothesis we have DT, 1 = DT N[u 1 ], 1 = DH, 1 1 t 2 = 1 αh 1 t 1. Therefore DT, 1 = 1 αt and the proof is complete. By Theorem 3.4 we have the following corollary: Corollary 3.5. For any forest F, DF ; 1 { 1, 1}, i.e., the number of dominating sets of even size varies by at most one from the number of dominating sets of odd size. Lemma 3.6. [2] If n is a positive integer, then 3 if n 0 mod 4; DC n, 1 = 1 otherwise. Corollary 3.7. For any n 4, DW n, 1 { 1, 3}.
7 Graph polynomial at 1 and 1 55 Proof. Since for every n 4, DW n, x = x1 + x n 1 + DC n 1, x [4], the result follows from Lemma 3.6. Since DP n, x = x[dp n 1, x+dp n 2, x+dp n 3, x] and DC n, x = x[dc n 1, x+dc n 2, x+ DC n 3, x] see [6, 7] we have the following theorem: Theorem 3.8. i For every n 4, DP n, 1 = DP n 1, 1+DP n 2, 1+DP n 3, 1 with initial values DP 1, 1 = 1, DP 2, 1 = 3 and DP 3, 1 = 5. ii For every n 4, DC n, 1 = DC n 1, 1 + DC n 2, 1 + DC n 3, 1 with initial values DC 1, 1 = 1, DC 2, 1 = 3 and DC 3, 1 = 7. iii For any n 4, DW n, 1 = DC n 1, n 1. Theorem 3.9. Let G be a unicycle graph. Then DG, 1 {±1, ±3}. Proof. We prove the theorem by induction on n = V G. If n = 3, then G = K 3 and there is nothing to prove. Now, let n 4. If G = C n, then by Lemma 3.6, DG, 1 { 1, 3}. If G C n, then there exists a vertex u such that du = 1. Suppose that Nu = {v}. Clearly, at most one of the components of G N[u] is a unicycle graph. Now, by Theorems 3.3, 3.2 and 3.4 and induction hypothesis the proof is complete. Theorem [10] For every graph, the number of dominating sets is odd. Theorem Let G be a graph. Then DG, r is odd for every odd integer r. In particular DG, 1 is odd. Proof. Suppose that r, s are two odd integers. Clearly, for every graph G, DG, r DG, s mod 2. Therefore DG, r DG, 1 mod 2. So by Theorem 3.10, we conclude DG, r is odd. Therefore DG, 1 is odd. The following corollary is an immediate consequence of Theorem Corollary Every integer domination root of a graph G is even. We need the following theorem to prove another results: Theorem [4] Let G 1 and G 2 be graphs of orders n 1 and n 2, respectively. Then DG 1 + G 2, x = 1 + x n x n DG 1, x + DG 2, x. The following corollary is an immediate consequence of above theorem:
8 56 S. Alikhani and M. H. Reyhani Corollary For any two graphs G 1 and G 2 DG 1 + G 2, 1 = DG 1, 1 + DG 2, Theorem For any odd integer n = 2k 1 k Z, there is some connected graph G such that DG; 1 = n. Proof. Let G i 1 i k be k graphs with DG i, 1 = 1 for every i {1, 2,..., k} and H = G 1 + G G k. Then DH, x = DG 1, x DG k, x + k 1 and consequently, DH, 1 = k + k 1 = 2k 1 = n. So the result is true for positive odd integer. Now we consider negative odd integer. Let G i 1 i k be k graphs with DG i, 1 = 3 for every i {1, 2,..., k} and H = G 1 + G G k. Then DH, x = DG 1, x DG k, x + k 1 and consequently, DH, 1 = 3k + k 1 = 2k 1. As an example for positive odd integer in above theorem we consider complete n-partite graphs. It is easy to check that for the complete n-partite graph K m1,m 2,...,m n we have m n n DK m1,m 2,...,m n, x = x i x m i 11 + x m m i 1 1. i=m 1 i=2 Suppose that for every 1 i n the number m i is even. By above formula we have m n n DK m1,m 2,...,m n, 1 = 1 i + 1 i=m 1 2 Since all of m i are even, we have DK m1,...,m n, 1 = 2n 1. Now we give an example for negative odd integer in above theorem. Suppose that G is a unicycle graph G with DG, 1 = 3 see Theorem 3.9. Consider H = G } + G + {{... + G }. It is easy to see n times that DH, 1 = 2k + 1. In this paper we studied independence and domination polynomial at 1 and 1. There are many graphs which have 2 as domination roots as an example all graphs of the form H K 1 have this property, see [1]. We think that the study of the value of domination polynomial of a graph at 2 is important, because we have the following conjecture: Conjecture If r is an integer domination root of a graph, then r = 0 or r = 2. Acknowledgements. The authors would like to express their gratitude to the referee for helpful comments. The research of the first author was in part supported by a grant from IPM No
9 Graph polynomial at 1 and 1 57 References [1] S. Akbari, S. Alikhani, and Y. H. Peng, Characterization of graphs using domination polynomial, European J. Combin., [2] S. Akbari and M. R. Oboudi, Cycles are determined by their domination polynomials, Ars Combin., to appear. [3] Y. Alavi, P. J. Malde, A. J. Schwenk and P. Erdös, The vertex independence sequence of a graph is not constrained, Congr. Numer., [4] S. Alikhani and Y. H. Peng, Introduction to domination polynomial of a graph, Ars Combin., in press. Available at [5] S. Alikhani, Y. H. Peng, Domination polynomials of cubic graphs of order 10, Turkish J. Math., [6] S. Alikhani and Y. H. Peng, Dominating sets and domination polynomial of paths, Int. J. Math. Math. Sci., 2009, Article ID , 10 pages doi: /2009/ [7] S. Alikhani and Y. H. Peng, Dominating sets and domination polynomials of certain graphs, II, Opuscula Math., 30 No [8] S. Alikhani and Y. H. Peng, Independence roots and independence fractals of certain graphs, J. Appl. Math. Comput., [9] P. N. Balister, B. Bollobas, J. Cutler, and L. Pebody, The interlace polynomial of graphs at 1, European J. Combin., [10] A. E. Brouwer, The number of dominating sets of a finite graph is odd, preprint. [11] J. I. Brown, K. Dilcher and R. J. Nowakowski, Roots of independence polynomials of well covered graphs, J. Algebraic Combin., [12] R. Frucht and F. Harary, On the corona of two graphs, Aequationes Math., [13] I. Gutman and F. Harary, Generalizations of the matching polynomial, Utilitas Math., [14] R. P. Stanley, Acyclic orientations of graphs, Discrete Math., Saeid Alikhani Department of Mathematics, Yazd University, Yazd, Iran School of Mathematics, Institute for Research in Fundamental Sciences IPM, P.O. Box: , Tehran,Iran. alikhani@yazduni.ac.ir Mohammad H. Reyhani Department of Mathematics, Islamic Azad University, Yazd branch, Yazd, Iran mh reihani@iauyazd.ac.ir
Some New Approaches for Computation of Domination Polynomial of Specific Graphs
Journal of Mathematical Extension Vol. 8, No. 2, (2014), 1-9 Some New Approaches for Computation of Domination Polynomial of Specific Graphs S. Alikhani Yazd University E. Mahmoudi Yazd University M. R.
More informationIntroduction to Domination Polynomial of a Graph
Introduction to Domination Polynomial of a Graph arxiv:0905.2251v1 [math.co] 14 May 2009 Saeid Alikhani a,b,1 and Yee-hock Peng b,c a Department of Mathematics Yazd University 89195-741, Yazd, Iran b Institute
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationResearch Article Domination Polynomials of k-tree Related Graphs
International Combinatorics, Article ID 390170, 5 pages http://dx.doi.org/10.1155/2014/390170 Research Article Domination Polynomials of k-tree Related Graphs Somayeh Jahari and Saeid Alikhani Department
More informationTHE HOSOYA INDEX AND THE MERRIFIELD-SIMMONS INDEX OF SOME GRAPHS. Communicated by Alireza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN (print): 51-8657, ISSN (on-line): 51-8665 Vol 1 No (01), pp 51-60 c 01 University of Isfahan wwwcombinatoricsir wwwuiacir THE HOSOYA INDEX AND THE MERRIFIELD-SIMMONS
More informationOn the edge cover polynomial of a graph
On the edge cover polynomial of a graph Saieed Akbari a,b, Mohammad Reza Oboudi a,b a Department of Mathematical Sciences, Sharif University of Technology, P.O. Box 11155-9415, Tehran, Iran b School of
More informationOn Total Domination Polynomials of Certain Graphs
Journal of Mathematics and System Science 6 (2016) 123-127 doi: 10.17265/2159-5291/2016.03.004 D DAVID PUBLISHING S. Sanal 1 and H. E. Vatsalya 2 1. Faculty of Mathematics, Ibri College of Technology,
More informationAuthor to whom correspondence should be addressed; Tel.: ; Fax:
Symmetry 2011, 3, 472-486; doi:10.3390/sym3030472 OPEN ACCESS symmetry ISSN 2073-8994 www.mdpi.com/journal/symmetry Article On Symmetry of Independence Polynomials Vadim E. Levit 1, and Eugen Mandrescu
More informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
More informationA lower bound for the harmonic index of a graph with minimum degree at least two
Filomat 7:1 013), 51 55 DOI 10.98/FIL1301051W Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat A lower bound for the harmonic index
More informationTHE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER
Kragujevac Journal of Mathematics Volume 38(1 (2014, Pages 173 183. THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER JIAN-BO LV 1, JIANXI LI 1, AND WAI CHEE SHIU 2 Abstract. The harmonic
More informationd 2 -coloring of a Graph
d -coloring of a Graph K. Selvakumar and S. Nithya Department of Mathematics Manonmaniam Sundaranar University Tirunelveli 67 01, Tamil Nadu, India E-mail: selva 158@yahoo.co.in Abstract A subset S of
More informationarxiv: v1 [math.co] 20 Oct 2018
Total mixed domination in graphs 1 Farshad Kazemnejad, 2 Adel P. Kazemi and 3 Somayeh Moradi 1,2 Department of Mathematics, University of Mohaghegh Ardabili, P.O. Box 5619911367, Ardabil, Iran. 1 Email:
More informationGLOBAL MINUS DOMINATION IN GRAPHS. Communicated by Manouchehr Zaker. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 35-44. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir GLOBAL MINUS DOMINATION IN
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 informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationTHE HARMONIC INDEX OF SUBDIVISION GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN print: 5-8657, ISSN on-line: 5-8665 Vol. 6 No. 07, pp. 5-7. c 07 University of Isfahan toc.ui.ac.ir www.ui.ac.ir THE HARMONIC INDEX OF SUBDIVISION GRAPHS BIBI NAIME ONAGH
More informationThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn
More informationk-tuple Domatic In Graphs
CJMS. 2(2)(2013), 105-112 Caspian Journal of Mathematical Sciences (CJMS) University of Mazandaran, Iran http://cjms.journals.umz.ac.ir ISSN: 1735-0611 k-tuple Domatic In Graphs Adel P. Kazemi 1 1 Department
More informationOn the Stability of Independence Polynomials
arxiv:1802.02478v1 [math.co] 7 Feb 2018 On the Stability of Independence Polynomials Jason Brown and Ben Cameron Department of Mathematics & Statistics Dalhousie University Halifax, Canada Abstract The
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationGraphoidal Tree d - Cover
International J.Math. Combin. Vol. (009), 66-78 Graphoidal ree d - Cover S.SOMASUNDARAM (Department of Mathematics, Manonmaniam Sundaranar University, irunelveli 67 01, India) A.NAGARAJAN (Department of
More informationEnumeration of subtrees of trees
Enumeration of subtrees of trees Weigen Yan a,b 1 and Yeong-Nan Yeh b a School of Sciences, Jimei University, Xiamen 36101, China b Institute of Mathematics, Academia Sinica, Taipei 1159. Taiwan. Theoretical
More informationBipartite graphs with at most six non-zero eigenvalues
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (016) 315 35 Bipartite graphs with at most six non-zero eigenvalues
More informationThe independent set sequence of some families of trees
The independent set sequence of some families of trees David Galvin and Justin Hilyard December 1, 017 Abstract For a tree T, let i T (t be the number of independent sets of size t in T. It is an open
More informationNowhere-zero Unoriented Flows in Hamiltonian Graphs
Nowhere-zero Unoriented Flows in Hamiltonian Graphs S. Akbari 1,5, A. Daemi 2, O. Hatami 1, A. Javanmard 3, A. Mehrabian 4 1 Department of Mathematical Sciences Sharif University of Technology Tehran,
More informationLower bounds on the minus domination and k-subdomination numbers
Theoretical Computer Science 96 (003) 89 98 www.elsevier.com/locate/tcs Lower bounds on the minus domination and k-subdomination numbers Liying Kang a;, Hong Qiao b, Erfang Shan a, Dingzhu Du c a Department
More informationTransactions on Combinatorics ISSN (print): , ISSN (on-line): Vol. 4 No. 2 (2015), pp c 2015 University of Isfahan
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 2 (2015), pp. 1-11. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir UNICYCLIC GRAPHS WITH STRONG
More informationUniversity of Alabama in Huntsville Huntsville, AL 35899, USA
EFFICIENT (j, k)-domination Robert R. Rubalcaba and Peter J. Slater,2 Department of Mathematical Sciences University of Alabama in Huntsville Huntsville, AL 35899, USA e-mail: r.rubalcaba@gmail.com 2 Department
More informationNEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS
NEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS M. R. POURNAKI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let be a simplicial complex and χ be an s-coloring of. Biermann and Van
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More informationExtremal trees with fixed degree sequence for atom-bond connectivity index
Filomat 26:4 2012), 683 688 DOI 10.2298/FIL1204683X Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal trees with fixed degree
More informationOn the Turán number of forests
On the Turán number of forests Bernard Lidický Hong Liu Cory Palmer April 13, 01 Abstract The Turán number of a graph H, ex(n, H, is the maximum number of edges in a graph on n vertices which does not
More informationEXACT DOUBLE DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 25 (2005 ) 291 302 EXACT DOUBLE DOMINATION IN GRAPHS Mustapha Chellali Department of Mathematics, University of Blida B.P. 270, Blida, Algeria e-mail: mchellali@hotmail.com
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 3 No., 018 pp.179-194 DOI: 10.049/CCO.018.685.109 CCO Commun. Comb. Optim. Leap Zagreb Indices of Trees and Unicyclic Graphs Zehui Shao 1, Ivan Gutman,
More informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number Hong-Jian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 June 22, 2000 Abstract A proper vertex
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationSKEW-SPECTRA AND SKEW ENERGY OF VARIOUS PRODUCTS OF GRAPHS. Communicated by Ivan Gutman
Transactions on Combinatorics ISSN (print: 2251-8657, ISSN (on-line: 2251-8665 Vol. 4 No. 2 (2015, pp. 13-21. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir SKEW-SPECTRA AND SKEW ENERGY
More informationDistance labelings: a generalization of Langford sequences
Also available at http://amc-journal.eu ISSN -9 (printed edn.), ISSN -9 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA (0) Distance labelings: a generalization of Langford sequences S. C. López Departament
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More informationDominator Colorings and Safe Clique Partitions
Dominator Colorings and Safe Clique Partitions Ralucca Gera, Craig Rasmussen Naval Postgraduate School Monterey, CA 994, USA {rgera,ras}@npsedu and Steve Horton United States Military Academy West Point,
More informationOn sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs
On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs Saieed Akbari 1,2 Ebrahim Ghorbani 1,2 Jacobus H. Koolen 3,4 Mohammad Reza Oboudi 1,2 1 Department of Mathematical Sciences
More informationCounting independent sets of a fixed size in graphs with a given minimum degree
Counting independent sets of a fixed size in graphs with a given minimum degree John Engbers David Galvin April 4, 01 Abstract Galvin showed that for all fixed δ and sufficiently large n, the n-vertex
More informationComplementary Signed Dominating Functions in Graphs
Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 38, 1861-1870 Complementary Signed Dominating Functions in Graphs Y. S. Irine Sheela and R. Kala Department of Mathematics Manonmaniam Sundaranar University
More informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 1295 1300 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml The Roman domatic number of a graph S.M.
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationThe Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences. Dedicated to professor Tian Feng on the occasion of his 70 birthday
The Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences Xiao-Dong ZHANG Ü À Shanghai Jiao Tong University xiaodong@sjtu.edu.cn Dedicated to professor Tian Feng on the occasion of his
More informationThe smallest Randić index for trees
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 123, No. 2, May 2013, pp. 167 175. c Indian Academy of Sciences The smallest Randić index for trees LI BINGJUN 1,2 and LIU WEIJUN 2 1 Department of Mathematics,
More informationSOME VERTEX-DEGREE-BASED TOPOLOGICAL INDICES UNDER EDGE CORONA PRODUCT
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 07 8 9 8 SOME VERTEX-DEGREE-BASED TOPOLOGICAL INDICES UNDER EDGE CORONA PRODUCT I. Rezaee Abdolhosseinzadeh F. Rahbarnia M. Tavaoli Department of Applied
More informationGraph homomorphism into an odd cycle
Graph homomorphism into an odd cycle Hong-Jian Lai West Virginia University, Morgantown, WV 26506 EMAIL: hjlai@math.wvu.edu Bolian Liu South China Normal University, Guangzhou, P. R. China EMAIL: liubl@hsut.scun.edu.cn
More informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 432 2010 661 669 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa On the characteristic and
More informationReconstructing subgraph-counting graph polynomials of increasing families of graphs
Reconstructing subgraph-counting graph polynomials of increasing families of graphs Boštjan Brešar University of Maribor, FERI, Smetanova 17, 2000 Maribor, Slovenia e-mail: bostjan.bresar@uni-mb.si Wilfried
More informationAALBORG UNIVERSITY. Merrifield-Simmons index and minimum number of independent sets in short trees
AALBORG UNIVERSITY Merrifield-Simmons index and minimum number of independent sets in short trees by Allan Frendrup, Anders Sune Pedersen, Alexander A. Sapozhenko and Preben Dahl Vestergaard R-2009-03
More informationOn (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
More informationThe Number of Independent Sets in a Regular Graph
Combinatorics, Probability and Computing (2010) 19, 315 320. c Cambridge University Press 2009 doi:10.1017/s0963548309990538 The Number of Independent Sets in a Regular Graph YUFEI ZHAO Department of Mathematics,
More informationEquitable Colorings of Corona Multiproducts of Graphs
Equitable Colorings of Corona Multiproducts of Graphs arxiv:1210.6568v1 [cs.dm] 24 Oct 2012 Hanna Furmańczyk, Marek Kubale Vahan V. Mkrtchyan Abstract A graph is equitably k-colorable if its vertices can
More informationCycles with consecutive odd lengths
Cycles with consecutive odd lengths arxiv:1410.0430v1 [math.co] 2 Oct 2014 Jie Ma Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213. Abstract It is proved that there
More informationRELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS. Communicated by Ali Reza Ashrafi. 1. Introduction
Bulletin of the Iranian Mathematical Society Vol. 39 No. 4 (2013), pp 663-674. RELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS A. ERFANIAN AND B. TOLUE Communicated by Ali Reza Ashrafi Abstract. Suppose
More informationSome results on the roots of the independence polynomial of graphs
Some results on the roots of the independence polynomial of graphs Ferenc Bencs Central European University Algebraic and Extremal Graph Theory Conference Aug 9, 2017 Supervisor: Péter Csikvári Denition,
More informationarxiv: v1 [math.co] 21 Sep 2017
Chromatic number, Clique number, and Lovász s bound: In a comparison Hamid Reza Daneshpajouh a,1 a School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran, P.O. Box 19395-5746
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationMULTIPLICATIVE ZAGREB ECCENTRICITY INDICES OF SOME COMPOSITE GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 21-29. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir MULTIPLICATIVE ZAGREB ECCENTRICITY
More informationBalanced Biclique Polynomial of Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-768 Volume, Number 5 (06, pp. 447 4433 Research India Publications http://www.ripublication.com/gjpam.htm Balanced Biclique Polynomial of Graphs
More informationOn graphs having a unique minimum independent dominating set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(3) (2017), Pages 357 370 On graphs having a unique minimum independent dominating set Jason Hedetniemi Department of Mathematical Sciences Clemson University
More informationSTUDIES IN GRAPH THEORY - DISTANCE RELATED CONCEPTS IN GRAPHS. R. ANANTHA KUMAR (Reg. No ) DOCTOR OF PHILOSOPHY
STUDIES IN GRAPH THEORY - DISTANCE RELATED CONCEPTS IN GRAPHS A THESIS Submitted by R. ANANTHA KUMAR (Reg. No. 200813107) In partial fulfillment for the award of the degree of DOCTOR OF PHILOSOPHY FACULTY
More informationEquitable coloring of corona products of cubic graphs is harder than ordinary coloring
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 10 (2016) 333 347 Equitable coloring of corona products of cubic graphs
More informationREVISTA INVESTIGACIÓN OPERACIONAL VOL. 37, NO. 2, , 2016
REVISTA INVESTIGACIÓN OPERACIONAL VOL. 37, NO., 115-13, 016 COMPUTING THE STRONG ALLIANCE POLYNOMIAL OF A GRAPH W. Carballosa,, J. C. Hernández-Gómez,, O. Rosario, and Y. Torres-Nuñez, Cátedra CONACYT,
More informationIndependent Transversal Dominating Sets in Graphs: Complexity and Structural Properties
Filomat 30:2 (2016), 293 303 DOI 10.2298/FIL1602293A Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Independent Transversal Dominating
More informationNOTE ON THE SKEW ENERGY OF ORIENTED GRAPHS. Communicated by Ivan Gutman. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 1 (2015), pp. 57-61. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir NOTE ON THE SKEW ENERGY OF
More informationSome results on incidence coloring, star arboricity and domination number
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 54 (2012), Pages 107 114 Some results on incidence coloring, star arboricity and domination number Pak Kiu Sun Wai Chee Shiu Department of Mathematics Hong
More informationZero sum partition of Abelian groups into sets of the same order and its applications
Zero sum partition of Abelian groups into sets of the same order and its applications Sylwia Cichacz Faculty of Applied Mathematics AGH University of Science and Technology Al. Mickiewicza 30, 30-059 Kraków,
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 informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationGraceful Related Labeling and its Applications
International Journal of Mathematics Research (IJMR). ISSN 0976-5840 Volume 7, Number 1 (015), pp. 47 54 International Research Publication House http://www.irphouse.com Graceful Related Labeling and its
More informationDouble domination edge removal critical graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 48 (2010), Pages 285 299 Double domination edge removal critical graphs Soufiane Khelifi Laboratoire LMP2M, Bloc des laboratoires Université demédéa Quartier
More informationarxiv: v1 [math.co] 23 Nov 2015
arxiv:1511.07306v1 [math.co] 23 Nov 2015 RAMSEY NUMBERS OF TREES AND UNICYCLIC GRAPHS VERSUS FANS MATTHEW BRENNAN Abstract. The generalized Ramsey number R(H, K) is the smallest positive integer n such
More informationAverage distance, radius and remoteness of a graph
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (0) 5 Average distance, radius and remoteness of a graph Baoyindureng
More information0-Sum and 1-Sum Flows in Regular Graphs
0-Sum and 1-Sum Flows in Regular Graphs S. Akbari Department of Mathematical Sciences Sharif University of Technology Tehran, Iran School of Mathematics, Institute for Research in Fundamental Sciences
More informationAcyclic and Oriented Chromatic Numbers of Graphs
Acyclic and Oriented Chromatic Numbers of Graphs A. V. Kostochka Novosibirsk State University 630090, Novosibirsk, Russia X. Zhu Dept. of Applied Mathematics National Sun Yat-Sen University Kaohsiung,
More informationBalanced bipartitions of graphs
2010.7 - Dedicated to Professor Feng Tian on the occasion of his 70th birthday Balanced bipartitions of graphs Baogang Xu School of Mathematical Science, Nanjing Normal University baogxu@njnu.edu.cn or
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationSATURATION SPECTRUM OF PATHS AND STARS
1 Discussiones Mathematicae Graph Theory xx (xxxx 1 9 3 SATURATION SPECTRUM OF PATHS AND STARS 4 5 6 7 8 9 10 11 1 13 14 15 16 17 18 Jill Faudree Department of Mathematics and Statistics University of
More informationOn zero sum-partition of Abelian groups into three sets and group distance magic labeling
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 13 (2017) 417 425 On zero sum-partition of Abelian groups into three
More informationOn the nullity number of graphs
Electronic Journal of Graph Theory and Applications 5 (2) (2017), 335 346 On the nullity number of graphs Mustapha Aouchiche, Pierre Hansen GERAD and HEC Montréal, Montreal, Canada mustapha.aouchiche@gerad.ca,
More informationarxiv: v2 [math.co] 5 Nov 2015
Upper bounds for the achromatic and coloring numbers of a graph arxiv:1511.00537v2 [math.co] 5 Nov 2015 Baoyindureng Wu College of Mathematics and System Sciences, Xinjiang University Urumqi, Xinjiang
More informationAalborg Universitet. The number of independent sets in unicyclic graphs Pedersen, Anders Sune; Vestergaard, Preben Dahl. Publication date: 2005
Aalborg Universitet The number of independent sets in unicyclic graphs Pedersen, Anders Sune; Vestergaard, Preben Dahl Publication date: 2005 Document Version Publisher's PDF, also known as Version of
More informationSome properties of the first general Zagreb index
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 285 294 Some properties of the first general Zagreb index Muhuo Liu Bolian Liu School of Mathematic Science South China Normal University Guangzhou
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 1 No. 2, 2016 pp.137-148 DOI: 10.22049/CCO.2016.13574 CCO Commun. Comb. Optim. On trees and the multiplicative sum Zagreb index Mehdi Eliasi and Ali
More informationA note on balanced bipartitions
A note on balanced bipartitions Baogang Xu a,, Juan Yan a,b a School of Mathematics and Computer Science Nanjing Normal University, 1 Ninghai Road, Nanjing, 10097, China b College of Mathematics and System
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 informationarxiv: v1 [math.co] 5 Sep 2016
Ordering Unicyclic Graphs with Respect to F-index Ruhul Amin a, Sk. Md. Abu Nayeem a, a Department of Mathematics, Aliah University, New Town, Kolkata 700 156, India. arxiv:1609.01128v1 [math.co] 5 Sep
More informationTwo problems on independent sets in graphs
Two problems on independent sets in graphs David Galvin June 14, 2012 Abstract Let i t (G) denote the number of independent sets of size t in a graph G. Levit and Mandrescu have conjectured that for all
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationSolutions to Unsolved Problems on the Minimal Energies of Two Classes of Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (2011) 943-958 ISSN 0340-6253 Solutions to Unsolved Problems on the Minimal Energies of Two Classes of
More informationNew bounds on the signed domination numbers of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 61(3) (015), Pages 73 80 New bounds on the signed domination numbers of graphs S.M. Hosseini Moghaddam Department of Mathematics Qom Branch, Islamic Azad University
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 information