Search Results

You are looking at 1 - 10 of 4,297 items for :

Clear All
Open access

Arturo Álvarez-Arenas, Juan Belmonte-Beitia and Gabriel F. Calvo

. (46) and their corresponding homoclinic orbits. Fig. 2 Bright solitary waves for β = 0.3, ϕ 0 = 0.5 and c = 2.5. (a) Profiles from Eq. (45) (solid curve) and the explicit solution given by Eq. (46) (dashed curve). (b) Homoclinic orbits from Eq. (45) (solid curve) and Eq. (46) (dashed curve). 4.2 Minimum speed of positive solutions We now wish to determine the minimum speed c 0 above which the solutions of Eq. (45) are positive for all ξ , since biologically feasible solutions for the tumor density must be positive for all ξ

Open access

Jill Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson and Brent J. Thomas

R eferences [1] K. Amin, J. Faudree and R.J. Gould, The edge spectrum of K 4 -saturated graphs , J. Combin. Math. Combin. Comput. 81 (2012) 233–242. [2] K. Amin, J. Faudree, R.J. Gould and E. Sidorowicz, On the non- ( p − 1) -partite K p -free graphs , Discuss. Math. Graph Theory 33 (2013) 9–23. doi:10.7151/dmgt.1654 [3] C. Barefoot, K. Casey, D. Fisher, K. Fraughnaugh and F. Harary, Size in maximal triangle-free graphs and minimal graphs of diameter 2, Discrete Math. 138 (1995) 93–99. doi:10.1016/0012-365X(94)00190-T [4] G

Open access

Abdul Qudair Baig, Muhammad Naeem and Wei Gao

Nonlinear Sciences 1 291 300 10.21042/AMNS.2016.1.00024 [4] B. Basavanagoud, W. Gao, S. Patil, V. R. Desai, K. G. Mirajkar, B. Pooja, (2017), Computing first Zagreb index and F-index of new C-products of graphs, Applied Mathematics and Nonlinear Sciences, 2, 285–298. 10.21042/AMNS.2017.1.00024 Basavanagoud B. Gao W. Patil S. Desai V.R. Mirajkar K.G. Pooja B. 2017 Computing first Zagreb index and F-index of new C-products of graphs Applied Mathematics and Nonlinear Sciences 2 285 298 10.21042/AMNS.2017.1.00024 [5] A. A. Dobrynin, R. Entringer, I. Gutman, (2001

Open access

Izolda Gorgol and Anna Lechowska

a cycle, Combin. Probab. Comput. 12 (2003) 585-598. doi: 10.1017/S096354830300590X [20] T. Jiang and D.B. West, Edge-colorings of complete graphs that avoid polychromatic trees, Discrete Math. 274 (2004)) 137-145. doi: 10.1016/j.disc.2003.09.002 [21] S. Jendrol’, I. Schiermeyer and J. Tu, Rainbow numbers for matchings in plane triangulations, Discrete Math. 331 (2014) 158-164. doi: 10.1016/j.disc.2014.05.012 [22] S. Klavžar, U. Milutinović and C. Petr, Combinatorics of topmost discs of multi-peg Tower of Hanoi

Open access

Sunilkumar M. Hosamani

S of V is called a connected dominating set of G if every vertex in V − S is adjacent to at least one vertex in S and the subgraph induced by the set S is connected. The connected domination number γ c ( G ) of a graph G is the minimum cardinality of a connected dominating set of G . E. J. Cockayne et. al [ 3 ] have introduced the concept of total domination as follows. Let G = ( V , E ) be a graph. A subset S of V is called a total dominating set of G if every vertex G is adjacent some vertex in S . The total domination number γ t

Open access

Y.M. Borse and Ganesh Mundhe

Abstract

Slater introduced the point-addition operation on graphs to characterize 4-connected graphs. The Г-extension operation on binary matroids is a generalization of the point-addition operation. In general, under the Г-extension operation the properties like graphicness and cographicness of matroids are not preserved. In this paper, we obtain forbidden minor characterizations for binary matroids whose Г-extension matroids are graphic (respectively, cographic).

Open access

Paul Horn, Ronald J. Gould, Michael S. Jacobson and Brent J. Thomas

References [1] K. Amin, J. Faudree, R.J. Gould and E. Sidorowicz, On the non-(p − 1)-partite Kp-free graphs, Discuss. Math. Graph Theory 33 (2013) 9-23. doi: 10.7151/dmgt.1654 [2] C. Barefoot, K. Casey, D. Fisher, K. Fraughnaugh and F. Harary, Size in maximal triangle-free graphs and minimal graphs of diameter 2, Discrete Math. 138 (1995) 93-99. doi: 10.1016/0012-365X(94)00190-T [3] G.A. Dirac, Some theorems on abstract graphs, Proc. Lond. Math. Soc. s3-2 (1952) 69-81. doi: 10.1112/plms/s3

Open access

Xueliang Li, Yaping Mao and Ivan Gutman

.L. Puertas, Steiner distance and convexity in graphs , European J. Combin. 29 (2008) 726–736. doi:10.1016/j.ejc.2007.03.007 [6] G. Chartrand, O.R. Oellermann, S.L. Tian and H.B. Zou, Steiner distance in graphs , Časopis Pest. Mat. 114 (1989) 399–410. [7] L. Chen, X. Li and M. Liu, The ( revised ) Szeged index and the Wiener index of a nonbipartite graph , European J. Combin. 36 (2014) 237–246. doi:10.1016/j.ejc.2013.07.019 [8] P. Dankelmann, O.R. Oellermann and H.C. Swart, The average Steiner distance of a graph , J. Graph Theory 22 (1996

Open access

V.R. Kulli, B. Chaluvaraju and H.S. Boregowda

Abstract

Let G = (V, E) be a connected graph with vertex set V (G) and edge set E(G). The product connectivity Banhatti index of a graph G is defined as, PB(G)=ue1dG(u)dG(e) where ue means that the vertex u and edge e are incident in G. In this paper, we determine P B(G) of some standard classes of graphs. We also provide some relationship between P B(G) in terms of order, size, minimum / maximum degrees and minimal non-pendant vertex degree. In addition, we obtain some bounds on P B(G) in terms of Randić, Zagreb and other degree based topological indices of G.

Open access

V. Lokesha, T. Deepika, P. S. Ranjini and I. N. Cangul

these topological indices. Muhammad Faisal Nadeem et. al., [ 17 ], computed generalized Randic, general Zagreb, general sum-connectivity, ABC , GA , ABC 4 , and GA 5 indices of the line graphs of 2D-lattice, nanotube and nanotorus of TUC 4 C 8 [ p , q ] by using the concept of subdivision. Sunil Hosamani [ 12 ], worked on computing sanskruti index of certain nanostructures. Computed the expressions for the Sanskruti index of the line graph of subdivision graph of the 2D-lattice, nanotube and nanotorus of TUC 4 C 8 [ p , q ]. Recently, C. K. Gupta