Note on p-competition Graphs and Paths
|
|
- Catherine Page
- 5 years ago
- Views:
Transcription
1 Southeast Asian Bulletin of Mathematics (2018) 42: Southeast Asian Bulletin of Mathematics c SEAMS Note on p-competition Graphs and Paths Y. Kidokoro, K. Ogawa, S. Tagusari, M. Tsuchiya Department of Mathematical Sciences, Tokai University Hiratsuka , Japan mtsuchiya@tsc.u-tokai.ac.jp Received 27 July 2016 Accepted 14 March 2017 Communicated by K. Denecke AMS Mathematics Subject Classification(2000): 05C20, 05C75 Abstract. The p-competition graph C p(d) of a digraph D = (V,A) is a graph with V(C p(d)) = V(D), where an edge between distinct vertices x and y if and only if there exist p distinct vertices,,...,v p V such that x v i, y v i are arcs of the digraph D for each i = 1,2,...,p. In this paper, we obtain that a path with order n 6 is a p-competition graph if and only if n p + 3. We also show that for a p-competition graph G with no isolated vertices, G+K n is a p+n-competition graph. And we obtain that a wheel W n is a p-competition graph if and only if n p+3. Keywords: p-competition graph; Path; Wheel. 1. Introduction In this paper we consider finite simple graphs without loops and finite digraphs allowed loops. For a graph G and S V(G), S V is the induced subgraph of S. A clique in a graph G is the vertex set of a maximal complete subgraph of G. A family Q = {Q 1,Q 2,...,Q l } is an edge clique cover of G if each Q i is a clique of G and for each uv E(G), there exists Q i Q such that u,v Q i. For a digraph D and v V(D), Out D (v) = {u;v u A(D)} and In D (v) = {u;u v A(D)}. Definition 1.1. For a digraph D, the p-competition graph C p (D) of D is the Corresponding author.
2 576 Y. Kidokoro et al. graph satisfying the following: (i) V(C p (D)) = V(D), (ii) xy E(C p (D)) if and only if there exist distinct p vertices,,..., v p V(D) such that x v i, y v i A(D) for each i = 1,2,...,p. AgraphGiscalledap-competition graphifthereexistsadigraphd suchthat C p (D) = G. Let ( [r] p) be the family of all p-subsets of an r-set [r] = {1,2,...,r}. v 0 v 5 v 4 Digraph D v 0 v 5 v 4 2-competition graph C 2 (D) Figure 1: A digraph D and the 2-competition graph C 2 (D) Definition 1.2. (p-edge Clique Cover) Let G be a graph and F = {S 1, S 2,..., S r } be a multifamily of subsets of the vertex set of G. The multifamily F is called a p-edge clique cover if it satisfies the following: (i) For any J ( ) [r] p, the set j J S j is a clique of G or an empty set, (ii) The family { j J S j J ( [r] p) } is an edge clique cover of G. Then θe(g) p = min F:p edge clique cover of G F is called the p-edge clique cover number of G. Dutton and Brigham [3] and Roberts and Steif [13] gave characterizations of competition graphs, which are 1-competition graphs. Lundgren [9] dealt with several properties of competition graphs. In [5] Isaak et al. gave the result on 2-competition graphs, that is, K 2,n is the 2-competition if and only if n = 1 or n 9. Jacobson [6] also gave the result on 2-competition graphs, that is, K n,n is the 2-competition if and only if n = 1. Anderson et al. [1] and Lundgren et al. [10] dealt with p-competition graphs of special types of digraphs. In [11] McKee and McMorris surveyed various properties of intersection graphs, which contain p-competition graphs. Kim et al. [7] gave a characterization of p-completion graphs in terms of p-edge clique covers as follows.
3 Note on p-competition Graphs and Paths 577 v 0 Graph G v 5 v 4 S 1 = {v 0,,v 4 } S 2 = {,,v 5 } S 3 = {, } S 4 = {v 0,,,,v 4,v 5 } S 5 = {v 0,,,,v 4,v 5 } F = {S 1,S 2,S 3,S 4,S 5 } θe 3(G) = 5 Figure 2: A graph G and a 3-edge clique cover F of G Theorem 1.3. [7] For a graph G with order n, G is a p-competition graph if and only if θ p e(g) n. Kim et al. [7] also gave the following result on chordal graphs. They dealt with individual graphs such as chordal graphs. They estimated θ 2 e(g) of individual graphs. Theorem 1.4. [7] (i) A chordal graph is a 2-competition graph, (ii) A cycle C 4 is not a 2-competition graph, (iii) For n > 4, a cycle C n is a 2-competition graph. In [8] Kim et al. dealt with cycles in terms of p-competition graphs. Kim et al. estimated θ p e (C n) and gave a characterization of p-competition cycles as follows. Theorem 1.5. [8] Let C n be a cycle with order n 5 and p be a positive integer. Then C n is a p-competition graph if and only if n p+3. In [2] Chen et al. obtained some properties of paths in bipartite graphs. They dealt with neighborhood conditions for vertex-disjoint paths in bipartite graphs. Using neighborhood conditions of the corresponding digraphs, we study p-competition graphs. Since each path is a chordal graph, we have the following result by Theorem 1.4. Corollary 1.6. Let P n be a path with order n 2. Then P n is a 2-competition graph.
4 578 Y. Kidokoro et al. In this paper we deal with paths in terms of p-completion graphs. In [12] Ogawa et al. considered on line graphs, that is, a unary graph operation. And Era et al. [4] dealt with upper bound graphs and double bound graphs in terms of special vertices, that is, universal vertices. In this paper we consider a sum operation on p-competition graphs. And we show some properties of wheels on p-competition graphs. A wheel is a sum graph of a cycle and an isolated vertex. 2. Paths In this section we consider a path with n vertices in terms of p-completion graphs. Let P n be a path with n vertices: V(P n ) = {v 0,,...,v n 1 } and E(P n ) = {v i v i+1 i = 0,1,...,n 2}. First we obtain the following result. Proposition 2.1. Paths P 2, P 3 and P 4 are not 3-competition graphs. Proof. First we consider the case P 2. Since the vertex number of P 2 is two, P 2 is not a 3-competition graph. Next we consider the case P 3. We assume that P 3 is a 3-competition graph of a digraph D with V(D) = {v 0,, }. Since v 0 E(P 3 ), the digraph D has arcs v 0 v 0, v 0, v 0, v 0, and. Since E(P 3 ), there exist arcs v 0,,, v 0, and. Then we consider six arcs v 0 v 0, v 0, v 0,, v 0, and. Thus v 0 and are adjacent in the 3-competition graph of D, which is a contradiction. We consider the case P 4. We assume that P 4 is a 3-competition graph of a digraph D with V(D) = {v 0,,, }. Since v 0 E(P 4 ), Out(v 0 ) Out( ) has three vertices of v 0,, and. Case 1: Out(v 0 ) Out( ) = {v 0,, }. Since E(P 4 ), we assume that there exist arcs v 0,,, v 0, and. Then for v 0 and, we have six arcs v 0 v 0, v 0, v 0,, v 0 and. Thus v 0 and are adjacent in the 3-competition graph of D, which is a contradiction. Hence Out( ) Out( ) is {v 0,, }, {v 0,, }, or {,, }. Then Out( ) = {v 0,,, }. Since E(P 4 ),Out( ) Out( )is{v 0,, }, {v 0,, }, {v 0,, }, or {,, }. Since Out( ) = {v i i = 0,1,2,3}, Out( ) Out( ) = 3. Thus and are adjacent in the 3-competition graph of D, which is a contradiction. Case 2: Out(v 0 ) Out( ) = {v 0,, }. As is the case with Case 1, we have a contradiction. Case 3: Out(v 0 ) Out( ) = {v 0,, }. Since E(P 4 ), we assume that there exist arcs v 0,,, v 0, and. Then for v 0 and, we have six arcs v 0 v 0, v 0, v 0,, v 0 and. Thus v 0 and
5 Note on p-competition Graphs and Paths 579 are adjacent in the 3-competition graph of D, which is a contradiction. Hence Out( ) Out( ) is {v 0,, }, {v 0,, }, or {,, }. Then Out( ) = {v 0,,, }. So Out( ) Out( ) = 3. Thus and are adjacent in the 3-competition graph of D, which is a contradiction. Case 4: Out(v 0 ) Out( ) = {,, }. As is the case with Case 3, we have a contradiction. Using similar arguments of the proof of Proposition 2.1, we obtain that P 5 is not 3-competition graphs. The following theorem is a generalization of Corollary 1.6 and Proposition 2.1. Theorem 2.2. Let P n be a path with order n 2 and p be a positive integer. Then P n is a p-competition graph if and only if n p+3. Proof. We assume that P n is a p-competition graph, p is a positive integer and p n 2. Let D be a digraph whose p-competition graph is P n, that is, C p (D) = P n, where V(D) = {v 0,,...,v n 1 }. Let F = {In(v 0 ),In( ),...,In(v n 1 )}. Since Out(v i ) Out(v j ) p for v i v j E(G), {In(v k ) F v i,v j In(v k )} p. Thus for any edge v i v j E(G), there exists the set k J In(v k) which contains both v i and v j, where J ( ). For each vertex pair p ), Out(u) Out(w) contains u and w of k J In(v k), where J ( p {v k k J} and Out(u) Out(w) p. Thus k J In(v k) is a clique of G. Therefore { k J In(v k) J ( ) p } is an edge clique cover of Pn and F = {In(v 0 ),In( ),...,In(v n 1 )} is a p-edge clique cover of P n. We assume that for i 0,n 1, v i V(P n ) belongs to all In(v k ) F. Since v i+1 and v i+2 are adjacent in P n, there exists the set k J In(v k) which contains v i+1 and v i+2, where J ( ) p. Then this set k J In(v k) contains v i. So v i is adjacent to v i+2, which is a contradiction. Thus v i belongs to at most n 1 sets of F. Since v i and v i+1 are adjacent in P n and v i 1 and v i are adjacent in P n, there exists the set k J In(v k) which contains v i and v i+1, and the set k K In(v k) which contains v i 1 and v i, where J,K ( ) p. On the other hand, since v i 1 are not adjacent to v i+1, the number of sets of F which contain v i 1 and v i+1 is at most p 1. ThusthenumberofsetsofF whichcontainv i isatleast(p+p) (p 1) = p+1. So we have that p+1 { In(v k ) F v i In(v k ) } n 1. Since p n 2, p + 1 n 1 and { In(v k ) F v i In(v k ) } = n 1. We also obtain { In(v k ) F v i+1 In(v k ) } = n 1 and { In(v k ) F v i+2 In(v k ) } = n 1. Since v i+1 is adjacent to v i, v i+2 and v i is not adjacent to v i+2, {v i,v i+1 } belongs to at most n 2 common sets in F. So p = n 2, because p n 2. Then {v i,v i+2 } belongs to at least n 2 = p common sets in F, because F is n. Thus v i and v i+2 are adjacent, which is a contradiction. Therefore n p+3. Next we show that P n is a p-competition graph for n p+3. We construct
6 580 Y. Kidokoro et al. a digraph D with order n as follows: (i) V(D) = {v 0,,...,v n 1 }, (ii) A(D) = {v 0 v i i = 1,2,...,p} {v n 1 v n 1, v n 1 v i (i = 0,1,...,p 2)} {v i v i, v i v i+1, v i v i+p (i = 1,2,...,n 2) }, where any subscripts are reduced to modulo n. v 0 v 1 v 5 v 2 v 4 Digraph D v 0 v 5 v 4 2-competition graph P 6 Figure 3: For p = 2 and n = 6, a digraph D and the 2-competition graph C 2 (D) = P 6 Then Out(v 0 ) = {,,...,v p }, Out(v n 1 ) = {v n 1,v 0,...,v p 2 }, Out(v i ) = {v i,v i+1,...,v i+p }, where any subscripts are reduced to modulo n. Then for Out(v i ) and Out(v i+1 ) (i = 1,2,...,n 3), Out(v i ) Out(v i+1 ) = {v i+1,v i+2,...,v i+p } and Out(v i ) Out(v i+1 ) = p. Thus the p-competition graph C p (D) has edges {v i,v i+1 } (i = 1,2,...,n 3). Then Out(v 0 ) Out( ) = {,,...,v p } and Out(v 0 ) Out( ) = p. Also Out(v n 2 ) Out(v n 1 ) = {v n 1,v 0,...,v p 2 } and Out(v n 2 ) Out(v n 1 ) = p. Thus the p-competition graph C p (D) has edges {v 0, }, {, },..., {v n 2,v n 1 }. Since Out(v n 1 ) Out(v 0 ) = {,,...,v p 2 } and Out(v n 1 ) Out(v 0 ) = p 2 < p, v n 1 is not adjacent to v 0 in the p-competition graph C p (D). For Out(v 0 ) = {,,...,v p } and Out(v i ) = {v i,v i+1,...,v i+p }, Out(v 0 ) Out(v i ) p 1 for i = 2,3,...,n 2. Thus v 0 is not adjacent to each v i in the p-competition graph C p (D) for i = 2,3,...,n 2. Since n p+3 and Out(v n 1 ) = p, Out(v n 1 ) Out(v i ) p 1 and v n 1 isnot adjacenttoeachv i inthe p-competitiongraphc p (D) fori=1,2,...,n 3. Since Out(v i ) = {v i,v i+1,...,v i+p } and n p+3, for Out(v i ) and Out(v j ), where j i 2 and i,j 0,n 1, the followings hold: (i) If j i = 2, Out(v j ) does not contain v i and v i+1, (ii) If j i p, Out(v j ) does not contain v i+p 1 and v i+p, (iii) If 2 < j i < p, Out(v j ) does not contain v i+1 and v i+2. Thus there exist at least two elements of Out(v j ) Out(v i ). Since Out(v j ) = p+1, Out(v i ) Out(v j ) p+1 2 = p 1 < p. So v i is not adjacent to
7 Note on p-competition Graphs and Paths 581 v j in the p-competition graph C p (D) for i,j = 1,2,...,n 2, where j i 2. Therefore C p (D) is P n. 3. A Sum Operation The sum G + H of two graphs G and H is the graph with the vertex set V(G+H) = V(G) V(H) and the edge set E(G+H) = E(G) E(H) {uv ; v V(G),u V(H)}. We obtain the following result on the sum G+K n. G u 1 u 2 H u 1 u 2 Sum G+H Figure 4: Graphs G,H and the sum G+H Proposition 3.1. Let G be a p-competition graph without isolated vertices. Then G+K n (n 1) is a (p+n)-competition graph. Proof. Let D be a digraph whose p-competition graph is G and V(D) = {,,...,v m }. We construct a digraph D as follows; (i) V(D ) = V(D) {u 1,u 2,...,u n }, (ii) A(D ) = A(D) ( i=1,2,...,m {v i u j j = 1,2,...,n}) ( i=1,2,...,n {u i v j and u i u k j = 1,2,...,m, k = 1,2,...,n}). v 5 v 4 Digraph D, Digraph D u 1 u 2 Figure 5: Digraphs D and D
8 582 Y. Kidokoro et al. Let G be a (p + n)-competition graph C p+n (D ). Since G has no isolated vertices, p m. Then i=1,2,...,n Out(u i) = m + n p + n and {u i i = 1,2,...,n} is a clique in C p+n (D ). Since G is a p-competition graph, if v i is adjacent to v j for i j, then Out(v i ) Out(v j ) = {u 1,u 2,...,u n } {w v i w and v j w in D } p+n. Thus {,,...,v m } V is G in the (p+n)-competition graph G. Since Out(v i ) Out(u j ) = {u 1,u 2,...,u n } {v j v i v j in D } for i = 1,2,...,m and j = 1,2,...,n, Out(v i ) Out(u j ) p+n and v i is adjacent to u j in G. Therefore C p+n (D ) = G+K n. By Proposition 3.1 we obtain the next result. Corollary 3.2. Let G be a p-competition graph without isolated vertices. Then G+K n (n 1) is also a p-competition graph. Proof. Let D be a digraph whose p-competition graph is G and V(D) = {,,...,v m }. We construct a digraph D as follows: (i) V(D ) = V(D) {u 1,u 2,...,u n }, (ii) A(D ) = A(D) i=1,2,...,n {u i v j j = 1,2,...,m}. Let G be the p-competition graph C p (D ) of D. Then for i = 1,2,...,n, Out(u i ) = {,,...,v m } and p m. Thus {u 1,u 2,...,u n } is a clique of G. Since G is a p-competition graph, {,,...,v m } V is G. For i = 1,2,...,m, Out(v i ) p and Out(v i ) {,,...,v m }. Thus v i is adjacent to u j for i = 1,2,...,m and j = 1,2,...,n. Therefore C p (D ) = G+K n. 4. Wheels A wheel W n is the graph C n 1 + K 1. Let v 0 be a degree n 1 vertex of W n and v i (i = 1,2,...,n 1) be degree three vertices of W n. And E(W n ) = {{, },{, },...,{v n 1, },{v 0, },{v 0, },...,{v 0,v n 1 }}. We have the next result on wheels. Proposition 4.1. Let W n be a wheel with order n and p be a positive integer. Then W n is a p-competition graph if and only if n p+3. Proof. We assume that W n is a p-competition graph and n p + 2. Let D be a digraph whose p-competition graph is W n, V(D) = {v 0,,...,v n 1 } and F = {In(v 0 ),In( ),...,In(v n 1 )}. Since C p (D) is W n, for an edge {v i,v j } in W n, Out(v i ) Out(v j ) p. Thus there exist at least p sets in F which contain v i and v j. So for any edge v i v j E(W n ), there exists the set k J In(v k) which contains v i and v j, where J ( ) p. For each vertex pair u and w of k J In(v k), where J
9 Note on p-competition Graphs and Paths 583 v 0 v 4 Wheel W 5 Figure 6: A wheel W 5 ( ) p, Out(u) Out(w) contains {vk k J} and Out(u) Out(w) p. Thus k J In(v k) is a clique of W n. Therefore { k J In(v k) J ( ) p } is an edge clique cover of W n and F = {In(v 0 ),In( ),...,In(v n 1 )} is a p-edge clique cover of W n. We assume that for i 0, v i V(W n ) belongs to all In(v k ) F. Since v i+1 and v i+2 are adjacent in W n, there exists the set k J In(v k) which contains v i+1 and v i+2, where J ( ) p. Then this set k J In(v k) contains v i. So v i is adjacent to v i+2, which is a contradiction. Thus v i belongs to at most n 1 sets of F. Since v i and v i+1 are adjacent in W n, and v i 1 and v i are adjacent in W n, there exists the set k J In(v k) which contains v i and v i+1, and the set k K In(v k) which contains v i 1 and v i, where J,K ( ) p. On the other hand, since v i 1 are not adjacent to v i+1, the number of sets of F which contain v i 1 and v i+1 is at most p 1. Thus the number of sets of F which contain v i is at least (p + p) (p 1) = p + 1. So we have that p+1 {In(v k ) F v i In(v k )} n 1. Since p n 2, p+1 n 1 and {In(v k ) F v i In(v k )} =n 1. Wealsoobtain {In(v k ) F v i+1 In(v k )} = n 1 and {In(v k ) F v i+2 In(v k )} = n 1. Since v i+1 is adjacent to v i and v i+2, v i is not adjacent to v i+2. Thus {v i,v i+1 } belongs to at most n 2 common sets in F. So p = n 2, because p n 2. Since F is n, {v i,v i+2 } belongs to at least n 2 common sets in F. Thus v i and v i+2 are adjacent, which is a contradiction. Therefore n p+3. By Theorem 1.5, C n is a (p 1)-competition graph, because n p+3 and n 1 (p 1) + 3. Thus W n = Cn 1 + K 1 is a p-competition graph by Proposition 3.1. References [1] C.A. Anderson, L. Langley, J.R. Lundgren, P.A. McKenna, S.K. Merz, New classes of p-competition graphs and φ-tolerance competition graphs, Congressus
10 584 Y. Kidokoro et al. Numerantium 100 (1994) [2] M. Chen, J. Li, J. Li, L. Wang, L. Zhang, On partitioning simple bipartite graphs in vertex-disjoint paths, Southeast Asian Bull. Math. 31 (2007) [3] R.D. Dutton and R.C. Brigham, A characterization of competition graphs, Discrete Applied Mathematics 6 (1983) [4] H. Era, K. Ogawa, M. Tsuchiya, Note on double bound graphs of infinite posets, Southeast Asian Bull. Math. 27 (2003) [5] G. Isaak, S.-R. Kim, T.A. McKee, F.R. McMorris, F.S. Roberts, 2-competition graphs, SIAM Journal on Discrete Mathematics 5 (1992) [6] M.S. Jacobson, On the p-edge clique cover number of complete bipartite graphs, SIAM Journal on Discrete Mathematics 5 (1992) [7] S.-R. Kim, T.A. McKee, F.R. McMorris, F.S. Roberts, p-competition graphs, Linear Algebra and its Applications 217 (1995) [8] S.-R. Kim, B. Park, Y. Sano, Cycles and p-competition graphs, Congressus Numerantium 196 (2009) [9] J.R. Lundgren, Food webs, competition graphs, competition-common enemy graphs, and niche graphs, In: Applications of Combinatorics and Graph Theory to be the Biological and Social Sciences, Ed. F.S. Roberts, IMA Vol. Math. Appl. 17, Springer-Verlag, New York, [10] J.R. Lundgren, P.A. McKenna, S.K. Merz, C.W. Rasmussen, The p-competition graphs of symmetric digraphs and p-neighborhood graphs, Journal of Combinatorics, Information & System Sciences 22 (1997) [11] T.A. McKee and F.R. McMorris, Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, [12] K. Ogawa and M. Tsuchiya, On upper bound graphs with respect to line graphs, Southeast Asian Bull. Math. 23 (1999) [13] F.S. Roberts and J.E. Steif, A characterization of competition graphs of arbitrary digraphs, Discrete Applied Mathematics 6 (1983)
Note on upper bound graphs and forbidden subposets
Discrete Mathematics 309 (2009) 3659 3663 www.elsevier.com/locate/disc Note on upper bound graphs and forbidden subposets Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya Department of Mathematical Sciences,
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 157 (2009) 2978 2982 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note Characterizations of competition
More informationCOMPETITION HYPERGRAPHS OF DIGRAPHS WITH CERTAIN PROPERTIES I STRONG CONNECTEDNESS
iscussiones Mathematicae Graph Theory 28 (2008) 5 21 COMPETITION HYPERGRAPHS OF IGRAPHS WITH CERTAIN PROPERTIES I STRONG CONNECTENESS Martin Sonntag Faculty of Mathematics und Computer Science TU Bergakademie
More informationInterval k-graphs and Orders
Interval k-graphs and Orders arxiv:1602.08669v1 [math.co] 28 Feb 2016 David E. Brown Department of Mathematics and Statistics Utah State University Logan, UT 84341-3900 U.S.A. Larry J. Langley Mathematics
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationInduced Cycles of Fixed Length
Induced Cycles of Fixed Length Terry McKee Wright State University Dayton, Ohio USA terry.mckee@wright.edu Cycles in Graphs Vanderbilt University 31 May 2012 Overview 1. Investigating the fine structure
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 informationPreprint Christian Garske, Martin Sonntag, Hans-Martin Teichert Niche hypergraphs ISSN
Fakultät für Mathematik und Informatik Preprint 2015-06 Christian Garske, Martin Sonntag, Hans-Martin Teichert Niche hypergraphs ISSN 1433-9307 Christian Garske, Martin Sonntag, Hanns-Martin Teichert Niche
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationExtremal Graphs Having No Stable Cutsets
Extremal Graphs Having No Stable Cutsets Van Bang Le Institut für Informatik Universität Rostock Rostock, Germany le@informatik.uni-rostock.de Florian Pfender Department of Mathematics and Statistics University
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationRelations between edge removing and edge subdivision concerning domination number of a graph
arxiv:1409.7508v1 [math.co] 26 Sep 2014 Relations between edge removing and edge subdivision concerning domination number of a graph Magdalena Lemańska 1, Joaquín Tey 2, Rita Zuazua 3 1 Gdansk University
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationON 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 informationDecomposing oriented graphs into transitive tournaments
Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
More informationLine Graphs and Forbidden Induced Subgraphs
Line Graphs and Forbidden Induced Subgraphs Hong-Jian Lai and Ľubomír Šoltés Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 July 14, 2002 Abstract Beineke and Robertson independently
More informationA graph with the partial order competition dimension greater than five
A graph with the partial order competition dimension greater than five Jihoon Choi Soogang Eoh Suh-Ryung Kim arxiv:1810.05278v1 [math.co] 11 Oct 2018 Abstract In this paper, weuse theerdös-szekeres lemma
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 informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationarxiv: v2 [math.co] 26 Apr 2014
Super edge-magic deficiency of join-product graphs arxiv:1401.45v [math.co] 6 Apr 014 A.A.G. Ngurah 1 Department of Civil Engineering Universitas Merdeka Malang Jalan Taman Agung No. 1 Malang, Indonesia
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationUNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS
UNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS MARIA CHUDNOVSKY, RINGI KIM, SANG-IL OUM, AND PAUL SEYMOUR Abstract. An n-vertex graph is prime if it has no homogeneous set, that
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationHAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH
HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH MICHAEL J. FERRARA, MICHAEL S. JACOBSON UNIVERSITY OF COLORADO DENVER DENVER, CO 8017 ANGELA HARRIS UNIVERSITY OF WISCONSIN-WHITEWATER WHITEWATER, WI
More informationDiscrete Applied Mathematics. Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Discrete Applied Mathematics 158 (010) 706 717 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Dimension- poset competition numbers
More informationStrongly chordal and chordal bipartite graphs are sandwich monotone
Strongly chordal and chordal bipartite graphs are sandwich monotone Pinar Heggernes Federico Mancini Charis Papadopoulos R. Sritharan Abstract A graph class is sandwich monotone if, for every pair of its
More informationInverse and Disjoint Restrained Domination in Graphs
Intern. J. Fuzzy Mathematical Archive Vol. 11, No.1, 2016, 9-15 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 17 August 2016 www.researchmathsci.org International Journal of Inverse and Disjoint
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 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 informationIndependence in Function Graphs
Independence in Function Graphs Ralucca Gera 1, Craig E. Larson 2, Ryan Pepper 3, and Craig Rasmussen 1 1 Naval Postgraduate School, Department of Applied Mathematics, Monterey, CA 93943; rgera@nps.edu,
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 informationarxiv: v2 [math.co] 29 Oct 2017
arxiv:1404.3385v2 [math.co] 29 Oct 2017 A proof for a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles G.R. Omidi Department of Mathematical Sciences, Isfahan University of Technology,
More informationOn disconnected cuts and separators
On disconnected cuts and separators Takehiro Ito 1, Marcin Kamiński 2, Daniël Paulusma 3 and Dimitrios M. Thilikos 4 1 Graduate School of Information Sciences, Tohoku University, Aoba-yama 6-6-05, Sendai,
More informationThe Lefthanded Local Lemma characterizes chordal dependency graphs
The Lefthanded Local Lemma characterizes chordal dependency graphs Wesley Pegden March 30, 2012 Abstract Shearer gave a general theorem characterizing the family L of dependency graphs labeled with probabilities
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
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 informationMultipartite tournaments with small number of cycles
Multipartite tournaments with small number of cycles Gregory Gutin and Arash Rafiey Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK Gutin(Arash)@cs.rhul.ac.uk
More informationGraphs with prescribed star complement for the. eigenvalue.
Graphs with prescribed star complement for the eigenvalue 1 F. Ramezani b,a B. Tayfeh-Rezaie a,1 a School of Mathematics, IPM (Institute for studies in theoretical Physics and Mathematics), P.O. Box 19395-5746,
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More informationPrime Factorization and Domination in the Hierarchical Product of Graphs
Prime Factorization and Domination in the Hierarchical Product of Graphs S. E. Anderson 1, Y. Guo 2, A. Rubin 2 and K. Wash 2 1 Department of Mathematics, University of St. Thomas, St. Paul, MN 55105 2
More informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
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 informationMINIMALLY NON-PFAFFIAN GRAPHS
MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect
More informationarxiv: v4 [math.co] 12 Nov 2015
Distance preserving graphs and graph products M. H. Khalifeh a, Bruce E. Sagan a, Emad Zahedi a,b, a Department of Mathematics, Michigan State University, East Lansing, MI 48824-1027, U.S.A. b Department
More informationARRANGEABILITY AND CLIQUE SUBDIVISIONS. Department of Mathematics and Computer Science Emory University Atlanta, GA and
ARRANGEABILITY AND CLIQUE SUBDIVISIONS Vojtěch Rödl* Department of Mathematics and Computer Science Emory University Atlanta, GA 30322 and Robin Thomas** School of Mathematics Georgia Institute of Technology
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 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 informationON MINUS TOTAL DOMINATION OF DIRECTED GRAPHS
Commun. Korean Math. Soc. 9 (014), No., pp. 359 366 http://dx.doi.org/10.4134/ckms.014.9..359 ON MINUS TOTAL DOMINATION OF DIRECTED GRAPHS WenSheng Li, Huaming Xing, and Moo Young Sohn Abstract. A three-valued
More informationProbe interval graphs and probe unit interval graphs on superclasses of cographs
Author manuscript, published in "" Discrete Mathematics and Theoretical Computer Science DMTCS vol. 15:2, 2013, 177 194 Probe interval graphs and probe unit interval graphs on superclasses of cographs
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 informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
More informationInverse Closed Domination in Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 2 (2016), pp. 1845-1851 Research India Publications http://www.ripublication.com/gjpam.htm Inverse Closed Domination in
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationPAIRS OF EDGES AS CHORDS AND AS CUT-EDGES
Discussiones Mathematicae Graph Theory 34 (2014) 673 681 doi:10.7151/dmgt.1755 PAIRS OF EDGES AS CHORDS AND AS CUT-EDGES Terry A. McKee Department of Mathematics and Statistics Wright State University
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More informationDisjoint paths in unions of tournaments
Disjoint paths in unions of tournaments Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 2 Princeton
More informationStandard Diraphs the (unique) digraph with no vertices or edges. (modulo n) for every 1 i n A digraph whose underlying graph is a complete graph.
5 Directed Graphs What is a directed graph? Directed Graph: A directed graph, or digraph, D, consists of a set of vertices V (D), a set of edges E(D), and a function which assigns each edge e an ordered
More informationPartial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs
Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Matemática, Facultad
More informationarxiv: v1 [math.ac] 11 Dec 2013
A KOSZUL FILTRATION FOR THE SECOND SQUAREFREE VERONESE SUBRING arxiv:1312.3076v1 [math.ac] 11 Dec 2013 TAKAYUKI HIBI, AYESHA ASLOOB QURESHI AND AKIHIRO SHIKAMA Abstract. The second squarefree Veronese
More informationHamilton Cycles in Digraphs of Unitary Matrices
Hamilton Cycles in Digraphs of Unitary Matrices G. Gutin A. Rafiey S. Severini A. Yeo Abstract A set S V is called an q + -set (q -set, respectively) if S has at least two vertices and, for every u S,
More informationarxiv: v1 [math.co] 3 Mar 2015 University of West Bohemia
On star-wheel Ramsey numbers Binlong Li Department of Applied Mathematics Northwestern Polytechnical University Xi an, Shaanxi 710072, P.R. China Ingo Schiermeyer Institut für Diskrete Mathematik und Algebra
More informationThe metric dimension of regular bipartite graphs
Bull. Math. Soc. Sci. Math. Roumanie Tome 54(10) No. 1, 011, 15 8 The metric dimension of regular bipartite graphs by M. Bača, E.T. Baskoro, A.N.M. Salman, S.W. Saputro, D. Suprijanto Abstract A set of
More informationSolution to a problem on hamiltonicity of graphs under Oreand Fan-type heavy subgraph conditions
Noname manuscript No. (will be inserted by the editor) Solution to a problem on hamiltonicity of graphs under Oreand Fan-type heavy subgraph conditions Bo Ning Shenggui Zhang Binlong Li Received: date
More informationarxiv: v1 [math.co] 18 Jan 2019
Edge intersection hypergraphs a new hypergraph concept Martin Sonntag 1, Hanns-Martin Teichert 2 arxiv:1901.06292v1 [math.co] 18 Jan 2019 1 Faculty of Mathematics and Computer Science, Technische Universität
More informationINVERTING SIGNED GRAPHS*
SIAM J. ALG. DISC METH. Vol. 5, No. 2, June 1984 @ 1984 Society for Industrial and Applied Mathematics 007 INVERTING SIGNED GRAPHS* HARVEY J. GREENBERG,? J. RICHARD LUNDGRENS AND JOHN S. MAYBEEB Abstract.
More informationarxiv: v1 [math.co] 12 Jul 2017
A SHARP DIRAC-ERDŐS TYPE BOUND FOR LARGE GRAPHS H.A. KIERSTEAD, A.V. KOSTOCHKA, AND A. McCONVEY arxiv:1707.03892v1 [math.co] 12 Jul 2017 Abstract. Let k 3 be an integer, h k (G) be the number of vertices
More informationOn Orthogonal Double Covers of Complete Bipartite Graphs by Disjoint Unions of Graph-Paths
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 3, March 2014, PP 281-288 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org On Orthogonal
More informationThe Simultaneous Local Metric Dimension of Graph Families
Article The Simultaneous Local Metric Dimension of Graph Families Gabriel A. Barragán-Ramírez 1, Alejandro Estrada-Moreno 1, Yunior Ramírez-Cruz 2, * and Juan A. Rodríguez-Velázquez 1 1 Departament d Enginyeria
More informationOn the Local Colorings of Graphs
On the Local Colorings of Graphs Behnaz Omoomi and Ali Pourmiri Department of Mathematical Sciences Isfahan University of Technology 84154, Isfahan, Iran Abstract A local coloring of a graph G is a function
More informationThe L(3, 2, 1)-labeling on the Skew and Converse Skew Products of Graphs
Advances in Theoretical and Applied Mathematics. ISSN 0973-4554 Volume 11, Number 1 (2016), pp. 29 36 Research India Publications http://www.ripublication.com/atam.htm The L(3, 2, 1)-labeling on the Skew
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationAn approximate version of Hadwiger s conjecture for claw-free graphs
An approximate version of Hadwiger s conjecture for claw-free graphs Maria Chudnovsky Columbia University, New York, NY 10027, USA and Alexandra Ovetsky Fradkin Princeton University, Princeton, NJ 08544,
More informationVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,
More informationExtendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations
Graphs and Combinatorics (2016) 32:1065 1075 DOI 10.1007/s00373-015-1636-0 ORIGINAL PAPER Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations Yanting Liang 1 Hong-Jian
More informationOn Disjoint Restrained Domination in Graphs 1
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 3 (2016), pp. 2385-2394 Research India Publications http://www.ripublication.com/gjpam.htm On Disjoint Restrained Domination
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationGraphs and Combinatorics
Graphs and Combinatorics (2006) 22:241 249 Digital Object Identifier (DOI) 10.1007/s00373-006-0641-8 Graphs and Combinatorics Springer-Verlag 2006 On n-partite Tournaments with Unique n-cycle Gregory Gutin,
More informationarxiv: v1 [math.co] 25 Dec 2017
Planar graphs without -cycles adjacent to triangles are DP--colorable Seog-Jin Kim and Xiaowei Yu arxiv:1712.08999v1 [math.co] 25 Dec 2017 December 27, 2017 Abstract DP-coloring (also known as correspondence
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 159 (2011) 1345 1351 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On disconnected cuts and separators
More informationPoset, competition numbers, and interval graph
Poset, competition numbers, and interval graph Yaokun Wu, Junjie Lu Department of Mathematics, Shanghai Jiao Tong University Shanghai, 200240, China Abstract Let D = (V (D), A(D)) be a digraph. The competition
More informationarxiv: v2 [math.co] 19 Aug 2015
THE (2k 1)-CONNECTED MULTIGRAPHS WITH AT MOST k 1 DISJOINT CYCLES H.A. KIERSTEAD, A.V. KOSTOCHKA, AND E.C. YEAGER arxiv:1406.7453v2 [math.co] 19 Aug 2015 Abstract. In 1963, Corrádi and Hajnal proved that
More informationEnumerating minimal connected dominating sets in graphs of bounded chordality,
Enumerating minimal connected dominating sets in graphs of bounded chordality, Petr A. Golovach a,, Pinar Heggernes a, Dieter Kratsch b a Department of Informatics, University of Bergen, N-5020 Bergen,
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationarxiv: v3 [math.co] 20 Feb 2014
On the balanced decomposition number Tadashi Sakuma 1 Systems Science and Information Studies arxiv:11.308v3 [math.co] 0 Feb 014 Faculty of Education, Art and Science Yamagata University 1-4-1 Kojirakawa,
More informationRegular factors of regular graphs from eigenvalues
Regular factors of regular graphs from eigenvalues Hongliang Lu Center for Combinatorics, LPMC Nankai University, Tianjin, China Abstract Let m and r be two integers. Let G be a connected r-regular graph
More informationOn the distance signless Laplacian spectral radius of graphs and digraphs
Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article 3 017 On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping
More informationCompletely Independent Spanning Trees in Some Regular Graphs
Completely Independent Spanning Trees in Some Regular Graphs Benoit Darties, Nicolas Gastineau, Olivier Togni To cite this version: Benoit Darties, Nicolas Gastineau, Olivier Togni. Completely Independent
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationTHE (2k 1)-CONNECTED MULTIGRAPHS WITH AT MOST k 1 DISJOINT CYCLES
COMBINATORICA Bolyai Society Springer-Verlag Combinatorica 10pp. DOI: 10.1007/s00493-015-3291-8 THE (2k 1)-CONNECTED MULTIGRAPHS WITH AT MOST k 1 DISJOINT CYCLES HENRY A. KIERSTEAD*, ALEXANDR V. KOSTOCHKA,
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 informationarxiv: v1 [math.co] 22 Jan 2018
arxiv:1801.07025v1 [math.co] 22 Jan 2018 Spanning trees without adjacent vertices of degree 2 Kasper Szabo Lyngsie, Martin Merker Abstract Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that
More informationFurther Studies on the Sparing Number of Graphs
Further Studies on the Sparing Number of Graphs N K Sudev 1, and K A Germina 1 Department of Mathematics arxiv:1408.3074v1 [math.co] 13 Aug 014 Vidya Academy of Science & Technology Thalakkottukara, Thrissur
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 informationGallai-Ramsey numbers for a class of graphs with five vertices arxiv: v1 [math.co] 15 Nov 2018
Gallai-Ramsey numbers for a class of graphs with five vertices arxiv:1811.06134v1 [math.co] 15 Nov 018 Xihe Li a,b and Ligong Wang a,b, a Department of Applied Mathematics, School of Science, Northwestern
More information