Golf Clubs

Subarashiki Nichijo $11.49 …

Huggies Snug & Dry Diapers Huggies diapers contain safe, absorbent particles that gel when wet. If you notice a small amount of gel-like material on your baby’s skin, it can be removed with a baby wipe or damp washcloth….

New – Bowflex Body Fat Monitor Scale – 17571516 Bowflex by Taylor Body Fat Monitor Scale. Measures Body Fat and Body Water. Estimates Bone Mass and Muscle Mass. Daily Caloric Reference to Gauge daily Calorie Intake. Accurate to 400 Pounds /180kgs. 10 Memories. Regular or Athlete Mode. The 4′ elongated LCD has a 1.2′ digit size for easy reading. A body fat and body water graph gives you a visual example of your fitness level….

Livescribe Single Subject Spiral Notebook ANA-00017, 4-Pack, Nos. 1-4 $16.99 Notebook Single Subject Lined Notebooks 1-4 4 Colors 4 PK…

Livescribe ANA-00018 Single Lined 100 Page 5-8 Notebook – 4 Pack (Spiral-Bound) $18.99 Each Livescribe ANA-00018 single subject notebook has 100 college-ruled perforated sheets. Perfect to take to classes and meetings. The Pulse smartpen only works with Livescribe dot paper. Use it to activate all smartpen applications….

Casio Scientific Calculator (FX260SLRSC) $6.10 FEATURES FRACTION CALCULATIONS TRIGONOMETRIC FUNCTIONS & MORE 1 & 2 VARIABLE STATISTICSMEAN/SUM/# ELEMENTSSTANDARD DEVIATIONSCIENTIFIC NOTATIONPOLAR/RECTANGULAR CONVERSATIONSOLAR POWEREDINCLUDES HARD SLIDE-ON CASEShipping Dimensions : 9.50in X 6.00in X 1.00inEstimated Shipping Weight : 0.3434…

Precalculus: Mathematics for Calculus, Enhanced Review Edition (with CD-ROM and iLrn(TM) Printed Access Card) $50.00 This Enhanced Review Edition includes new cumulative review material with solutions, to give you additional help with mastering the concepts….

Spectra of Graphs (Universitext) $44.84 This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics. Exercises at the end of  each chapter provide pract…

Abstract Regular Polytopes (Encyclopedia of Mathematics and its Applications) $169.79 Abstract regular polytopes stand at the end of more than two millennia of geometrical research, which began with regular polygons and polyhedra. The rapid development of the subject in the past twenty years has resulted in a rich new theory featuring an attractive interplay of mathematical areas, including geometry, combinatorics, group theory and topology. This is the first comprehensive, up-to-d…

Brain Challenge $19.99 Get your brain in shape with these fun daily exercises! No pain, stress, or boredom; just challenging and entertaining puzzles that act like a vitamin boost for your brain. Twenty different games in five categories (Memory, Visual, Logic, Math, and Focus) will train all areas of your brain. Evaluate your mental capacity under regular or stressful conditions with the Daily Test & the Stress Managem…

Callaway RAZR X HL Iron Combo Set Callaway RAZR X HL 3H, 4H, 5-PW Combo Iron Set- Graphite The Callaway RAZR X HL Combo Iron Set takes accuracy, distance and foregiveness to new highs. Each iron in this set has a low center of gravity so golfers can launch shots higher, even on impacts low on the face, so golf balls fly consistently farther and land softer on the greens. This low center of gravity makes the sweet spot more acc…

Callaway Diablo Octane Tour Fairway Woods $249.99 The Diablo Octane Tour fairway woods have smaller footprints and traditional hosels that inspire confidence at address.Designed to maximize power, Callaway’s all-stainless-steel Diablo Octane Tour fairway woods produce a remarkably consistent ball flight whether off the tee or from the fairway. The Diablo Octane Tour line–which are available in 13-, 15-, and 18-degree lofts–is distinguished by…

Adams Golf Idea Tech V3 Forged Hybrid Irons Combo, Set of 8 (4-GW) $899.99 From the leader in hybrid iron design comes the Idea Tech V3 forged hybrid iron set, which puts the latest technology and newest materials into the hands of golfers of all skill levels. Setting a new standard for design and performance, Idea Tech V3 hybrid irons are the easiest-to-hit hybrids yet created by the designers and engineers at Adams Golf. The Idea Tech V3 set includes 3 hybrid irons,…

Algebraic Graph Theory $14.14 Purchase includes free access to book updates online and a free trial membership in the publisher’s book club where you can select from more than a million books without charge. Chapters: Centrality, Cayley Graph, Graph Automorphism, Symmetric Graph, Clustering Coefficient, Adjacency Matrix, Kirchhoff’s Theorem, Distance-Transitive Graph, Conference Matrix, Modularity, Incidence Matrix, Algebraic Graph Theory, Cycle Space, Distance-Regular Graph, Algebraic Connectivity, Lovász Conjecture, Vertex-Transitive Graph, Ramanujan Graph, Two-Graph, Conductance, Spectral Graph Theory, Laplacian Matrix, Strongly Regular Graph, Dual Graph, Semi-Symmetric Graph, Ihara Zeta Function, Frucht’s Theorem, Half-Transitive Graph, Edge Space, Edge-Transitive Graph, Seidel Adjacency Matrix, Degree Matrix, Adjacency Algebra, Parry-Sullivan Invariant, Conference Graph, Integral Graph. Excerpt: In algebraic graph theory , the adjacency algebra of a graph G is the algebra of polynomials in the adjacency matrix A ( G ) of the graph. It is an example of a matrix algebra and is the set of the linear combinations of powers of A . Some other similar mathematical objects are also called “adjacency algebra”. Properties Properties of the adjacency algebra of G are associated with various spectral , adjacency and connectivity properties of G . Statement . The number of walks of length d between vertices i and j is equal to the ( i , j )-th element of A . Statement . The dimension if the adjacency algebra of a connected graph of diameter d is at least d + 1. Corollary . A connected graph of diameter d has at least d distinct eigenvalues . References (URLs online) A hyperlinked version of this chapter is at In mathematics and computer science , an adjacency matrix is a means of representing which vertices of a graph are adjacent to which other vertices. Another matrix representation for a graph is the incidence matrix . Specifically, the adjacency matrix of a finite graph G on n

Algebraic Graph Theory: Centrality, Cayley Graph, Graph Automorphism, Symmetric Graph, Clustering Coefficient, Adjacency Matrix $15.29 Used – Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 133. Not illustrated. Chapters: Centrality, Cayley Graph, Graph Automorphism, Symmetric Graph, Clustering Coefficient, Adjacency Matrix, Kirchhoff’s Theorem, Distance-Transitive Graph, Conference Matrix, Modularity, Incidence Matrix, Cycle Space, Distance-Regular Graph, Algebraic Connectivity, Lov sz Conjecture, Vertex-Transitive Graph, Ramanujan Graph, Tw

Algebraic Graph Theory: Centrality, Cayley Graph, Graph Automorphism, Symmetric Graph, Clustering Coefficient, Adjacency Matrix $15.29 New – Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 133. Not illustrated. Chapters: Centrality, Cayley Graph, Graph Automorphism, Symmetric Graph, Clustering Coefficient, Adjacency Matrix, Kirchhoff’s Theorem, Distance-Transitive Graph, Conference Matrix, Modularity, Incidence Matrix, Cycle Space, Distance-Regular Graph, Algebraic Connectivity, Lov sz Conjecture, Vertex-Transitive Graph, Ramanujan Graph, Two

Algebraic Graph Theory: Centrality, Cayley Graph, Graph Automorphism, Symmetric Graph, Clustering Coefficient, Adjacency Matrix $38.21 New – Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 133. Not illustrated. Chapters: Centrality, Cayley Graph, Graph Automorphism, Symmetric Graph, Clustering Coefficient, Adjacency Matrix, Kirchhoff’s Theorem, Distance-Transitive Graph, Conference Matrix, Modularity, Incidence Matrix, Cycle Space, Distance-Regular Graph, Algebraic Connectivity, Lov sz Conjecture, Vertex-Transitive Graph, Ramanujan Graph, Two

Algebraic Graph Theory: Centrality, Cayley Graph, Graph Automorphism, Symmetric Graph, Clustering Coefficient, Adjacency Matrix $15.29 Used – Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 133. Not illustrated. Chapters: Centrality, Cayley Graph, Graph Automorphism, Symmetric Graph, Clustering Coefficient, Adjacency Matrix, Kirchhoff’s Theorem, Distance-Transitive Graph, Conference Matrix, Modularity, Incidence Matrix, Cycle Space, Distance-Regular Graph, Algebraic Connectivity, Lov sz Conjecture, Vertex-Transitive Graph, Ramanujan Graph, Tw

Amplitude $42.56 Used – Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Amplitude is the magnitude of change in the oscillating variable with each oscillation within an oscillating system. For example, sound waves in air are oscillations in atmospheric pressure and their amplitudes are proportional to the change in pressure during one oscillation. If a variable undergoes regular oscillations, and a graph of the system is drawn with t

Amplitude $49.2 Used – Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Amplitude is the magnitude of change in the oscillating variable with each oscillation within an oscillating system. For example, sound waves in air are oscillations in atmospheric pressure and their amplitudes are proportional to the change in pressure during one oscillation. If a variable undergoes regular oscillations, and a graph of the system is drawn with t

Australia Odi Cricketers: Bob Simpson $9.05 Purchase includes free access to book updates online and a free trial membership in the publisher’s book club where you can select from more than a million books without charge. Excerpt: Robert Baddeley Simpson AO (born 3 February 1936) is a former cricketer who played for New South Wales, Western Australia and Australia, captaining the national team from 196364 until 196768, and again in 197778. He later had a highly successful term as the coach of the Australian team. He is also known as Bobbie or Simmo. Simpson played as a right-handed batsman and semi-regular leg spin bowler. After ten years in retirement, he returned to the spotlight at age 41 to captain Australia during the era of World Series Cricket. In 1986 he was appointed coach of the Australian team, a position he held until being replaced by Geoff Marsh in July 1996. Under Simpson’s tutelage, the team went from a struggling team, losing a succession of Test series, to the strongest team in world cricket. Some of the team’s greatest achievements in his time as coach were winning the 1987 World Cup, regaining The Ashes in England in 1989, and overcoming the previously dominant West Indies on their home grounds in 1995. He also coached county cricket in England, with Leicestershire and Lancashire. He was Wisden Cricketer of the Year in 1965. He was made an Officer of the Order of Australia in 2007. Bob Simpson’s career performance graph. In his prime Simpson was known for his technical correctness. At slightly below average height, his noted ability to bat for long periods were attributed to his high fitness and concentration levels. He had a wide array of shots, in particular off the back foot. Along with Bill Lawry, he formed an opening partnership that was regarded as one of the finest in Test history. Simpson was fast between the wickets, and the pair were especially well known for their understanding, as exemplified by their fluency in rotating the strike with… More:

Complete Graph $59 High Quality Content by WIKIPEDIA articles! In the mathematical field of graph theory, a complete graph is a simple graph in which every pair of distinct vertices is connected by an edge. The complete graph on n vertices has n vertices and n(n-1)/2 edges, and is denoted by (from the German komplett). It is a regular graph of degree . All complete graphs are their own cliques. They are maximally connected as the only vertex cut which disconnects the graph is the complete set of vertices.

Complete Graph $70.8 Used – High Quality Content by WIKIPEDIA articles! In the mathematical field of graph theory, a complete graph is a simple graph in which every pair of distinct vertices is connected by an edge. The complete graph on n vertices has n vertices and n(n-1)/2 edges, and is denoted by (from the German komplett). It is a regular graph of degree . All complete graphs are their own cliques. They are maximally connected as the only vertex cut which disconnects the graph is the complete set of vertices.

Cycles in graph theory and matroids. $49.99 A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is even. A graph G is Hamiltonian if it has a spanning circuit, and Hamiltonian-connected if for every pair of distinct vertices u, v ∈ V( G), G has a spanning (u, v)-path. A graph G is s-Hamiltonian if for any S ⊆ V (G) of order at most s, G — S has a Hamiltonian-circuit, and s-Hamiltonian connected if for any S ⊆ V( G) of order at most s, G — S is Hamiltonian-connected. In this dissertation, we investigated sufficient conditions for Hamiltonian and Hamiltonian related properties in a graph or in a line graph. In particular, we obtained sufficient conditions in terms of connectivity only for a line graph to be Hamiltonian, and sufficient conditions in terms of degree for a graph to be s-Hamiltonian and s-Hamiltonian connected.;A cycle C of G is a spanning eulerian subgraph of G if C is connected and spanning. A graph G is supereulerian if G contains a spanning eulerian subgraph. If G has vertices v1, v2, &cdots; ,vn, the sequence (d( v1),d(v2), &cdots; ,d(vn)) is called a degree sequence of G. A sequence d = ( d1,d2, &cdots; ,dn) is graphic if there is a simple graph G with degree sequence d. Furthermore, G is called a realization of d. A sequence d ∈ G is line-hamiltonian if d has a realization G such that L(G) is hamiltonian. In this dissertation, we obtained sufficient conditions for a graphic degree sequence to have a supereulerian realization or to be line hamiltonian.;In 1960, Erdos and Posa characterized the graphs G which do not have two edge-disjoint circuits. In this dissertation, we successfully extended the results to regular matroids and characterized the regular matroids which do not have two disjoint circuits.

Declarative Programming: Functional Programming, Logic Programming, Currying, Frame Problem, Unification, Graph Reduction Machine $25.03 Used – Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 117. Chapters: Functional programming, Logic programming, Currying, Frame problem, Unification, Graph reduction machine, Warren Abstract Machine, Monad, Belief revision, Constraint logic programming, Anonymous function, Stable model semantics, Quark Framework, First-class function, Default logic, Circumscription, Regular number, Situation calculus, Defeasi

Declarative Programming: Functional Programming, Logic Programming, Currying, Frame Problem, Unification, Graph Reduction Machine $25.03 New – Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 117. Chapters: Functional programming, Logic programming, Currying, Frame problem, Unification, Graph reduction machine, Warren Abstract Machine, Monad, Belief revision, Constraint logic programming, Anonymous function, Stable model semantics, Quark Framework, First-class function, Default logic, Circumscription, Regular number, Situation calculus, Defeasib

Discrete Mathematics with Proof $144 A Trusted Guide to Discrete Mathematics with Proof—Now in a Newly Revised EditionDiscrete mathematics has become increasingly popular in recent years due to its growing applications in the field of computer science. Discrete Mathematics with Proof, Second Edition continues to facilitate an up-to-date understanding of this important topic, exposing readers to a wide range of modern and technological applications.The book begins with an introductory chapter that provides an accessible explanation of discrete mathematics. Subsequent chapters explore additional related topics including counting, finite probability theory, recursion, formal models in computer science, graph theory, trees, the concepts of functions, and relations. Additional features of the Second Edition include:An intense focus on the formal settings of proofs and their techniques, such as constructive proofs, proof by contradiction, and combinatorial proofsNew sections on applications of elementary number theory, multidimensional induction, counting tulips, and the binomial distributionImportant examples from the field of computer science presented as applications including the Halting problem, Shannon’s mathematical model of information, regular expressions, XML, and Normal Forms in relational databasesNumerous examples that are not often found in books on discrete mathematics including the deferred acceptance algorithm, the Boyer-Moore algorithm for pattern matching, Sierpinski curves, adaptive quadrature, the Josephus problem, and the five-color theoremExtensive appendices that outline supplemental material on analyzing claims and writing mathematics, along with solutions to selected chapter exercisesCombinatorics receives a full chapter treatment that extends beyond the combinations and permutations material by delving into non-standard topics such as Latin squares, finite projective planes, balanced incomplete

Distance-Transitive Graph $42 High Quality Content by WIKIPEDIA articles! In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries v to x and w to y. A distance transitive graph is vertex transitive and symmetric as well as distance regular. A distance-transitive graph is interesting partly because it has a large automorphism group. Some interesting finite groups are the automorphism groups of distance-transitive graphs, especially of those whose diameter is 2. Distance-transitive graphs were first defined in 1971 by Norman L. Biggs and D. H. Smith, who showed that there are only 12 finite trivalent distance-transitive graphs.

Euclidean Plane Geometry $31.5 Purchase includes free access to book updates online and a free trial membership in the publisher’s book club where you can select from more than a million books without charge. Chapters: Compass and Straightedge Constructions, Golden Ratio, Polygon, Squaring the Square, Fermat Number, Projective Plane, Constructible Number, Bézout’s Theorem, Straightedge, Angle Trisection, Doubling the Cube, Problem of Apollonius, Pythagorean Theorem, Arrangement of Lines, Ptolemy’s Theorem, Euclidean Plane Isometry, Squaring the Circle, Pseudotriangle, Sylvester-gallai Theorem, Beta Skeleton, Special Cases of Apollonius’ Problem, Happy Ending Problem, Tiling by Regular Polygons, Apollonian Circles, Constructible Polygon, Power of a Point, Special Right Triangles, Descartes’ Theorem, Pole and Polar, Thales’ Theorem, Gaussian Period, Beck’s Theorem, Disquisitiones Arithmeticae, Brahmagupta’s Formula, Szemerédi-trotter Theorem, Inscribed Angle, Pick’s Theorem, Neusis Construction, List of Uniform Tilings, Heptadecagon, Philo Line, Tarski’s Circle-Squaring Problem, Napoleon’s Problem, Monge’s Theorem, Butterfly Theorem, Japanese Theorem for Cyclic Polygons, Gabriel Graph, Bolyai-gerwien Theorem, Internal and External Angle, Compass Equivalence Theorem, Mohr-mascheroni Theorem, Coxeter’s Loxodromic Sequence of Tangent Circles, Pasch’s Axiom, Harmonic Division, Poncelet-steiner Theorem, Pasch’s Theorem, 2d Geometric Model, Poncelet Point. Excerpt: A 2D geometric model is a geometric model of an object as two-dimensional figure, usually on the Euclidean or Cartesian plane .Even though all material objects are three-dimensional, a 2D geometric model is often adequate for certain flat objects, such as paper cut-outs and machine parts made of sheet metal .2D geometric models are also convenient for describing certain types of artificial images , such as technical diagrams , logos , the glyphs of a font , etc. They are an essential tool of 2D computer graphics and

Five topics in extremal and structural graph theory. $49.99 An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. We prove that G has an interval coloring using six colors when G is a (3, 4)-biregular bipartite graph having a spanning subgraph whose components are paths with endpoints at 3-valent vertices and lengths in {lcub}2, 4, 6, 8{rcub}. We also introduce a new variation of the interval coloring problem, wrapped coloring.;We study conditions under which subgraphs with maximum degree 1 or 2 of d-regular bipartite graphs extend to 1-factors or 2-factors. We prove that if M is a matching in Qd with at most k(d – k) edges and there is no deficient set of size less than k in the graph that remains when the endpoints of M are removed from Qd, then M extends to a 1-factor. This strengthens and generalizes a result of Limaye and Sarvate. We also show that if H is a subgraph of Qd with at most 2d – 3 edges and maximum degree 2, then H extends to a 2-factor. Moving beyond the d-dimensional hypercube, we give a Tutte-like necessary and sufficient condition in regular bipartite graphs for a subgraph H with maximum degree at most 2 to extend to a 2-factor. We provide several applications of this condition, particularly for the case when H is a matching.;The independence ratio of a graph is the fraction of vertices contained in a largest independent set. We study this for 2-factor-plus-triangles graphs, a class of graphs that generalizes cycle-plus-triangles graphs. Unlike cycle-plus-triangles graphs, these graphs may have independence ratio less than 1/3. We prove that the independence ratio of any 2-factor-plus-triangles graph is at least 1/4. We construct infinitely many connected 2-factor-plus-triangles graphs with independence ratio less than 4/15 and conjecture that 4/15 is the smallest value for which this is possible.;A p-page embedding of G is a vertex-ordering pi of V(G) (along the “spine” of a book) and an

Functional Programming: Currying, Graph Reduction Machine, Monad, Anonymous Function, Quark Framework, Regular Number, Immutable Object $21.77 Used – Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 62. Chapters: Currying, Graph reduction machine, Monad, Anonymous function, Quark Framework, Regular number, Immutable object, First-class function, Continuation-passing style, Algebraic data type, Polymorphism, Arrow, Parser combinator, Corecursion, Type class, Apply, Initial algebra, Higher-order function, Monad transformer, Cons, Brouwer-Heyting-Kolmogo

Functional Programming: Secd Machine, Currying, Graph Reduction Machine, Monad, Anonymous Function, Type Polymorphism, Regular Number $21.77 New – Chapters: Secd Machine, Currying, Graph Reduction Machine, Monad, Anonymous Function, Type Polymorphism, Regular Number, Continuation-Passing Style, Quark Framework, Immutable Object, Algebraic Data Type, First-Class Function, Arrow, Parser Combinator, Type Class, Initial Algebra, Higher-Order Function, Monad Transformer, Cons, Apply, Purely Functional, Brouwer-heyting-kolmogorov Interpretation, Zipper, Actant, Lout, Pure Function, Simon Peyton Jones, Append, F-Algebra, Strictness Analysis

GHOST Pickups Strat & Tele 2 3/16 spacing – Graph Tech -PN-8000-F0 $109.99 DESCRIPTIONS: Introducing: Graph Tech GHOST Pickups Strat & Tele 2 3/16 spacing from Graph Tech. Guitars Online Shop are happy to present the brilliant Graph Tech GHOST Pickups Strat & Tele 2 3/16 spacing. With so many available right now, it is good to have a name you can trust. The Graph Tech GHOST Pickups Strat & Tele 2 3/16 spacing is certainly that and will be a perfect buy. For this price, the Graph Tech GHOST Pickups Strat & Tele 2 3/16 spacing comes highly recommended and is always a regular choice for lots of people. Graph Tech have added some nice touches and this means good value. Features: ghost Ld Saddles, Strat Vi Acoustic Tones on Any Electric! Guitar Part ghostghost systemgraph tech ghostpiezo Vintage Style Piezo Saddles for Vintage Strat-style Guitars for Use with Graph Tech Acousti-Phonic Kits

Graph Regular

SBI Life-Smart Elite ULIP graph most Experienced

SBI Life-Smart Elite is a unit-linked life insurance plan crafted exclusively for high net worth individuals. The plan is no different from other Ulips offered by SBI Life except that it has a high premium bracket starting from Rs 1,50,000. It offers two protection options. Under the Gold option, the diagram provides a choice of higher of sum assured or fund value on unfortunate events.

Under the Platinum choice, the nominee of the policyholder would receive both. The scheme offers six alternative investment options (funds) with varying equity and debt exposure for the policyholder.

COST STRUCTURE: The large ticket size has helped keep the cost of this scheme low. The insurance company charges 15% premium allocation charges for a 5-year period. This is much lower than the 20-25% charged by some other insurers.

Additional premium paid towards investment purposes only (top-ups) attract a 2% allocation charge. The policy administration charge is fixed at Rs 600 per annum for a single premium policyholder and Rs 720 pa for the rest. This helps in keeping the cost organization low since the administration charge is defined in absolute terms and is not linked to the annual premium. It needs to be noted that the scheme’s mortality charges are same as that of the LIC mortality table, unlike other insurance companies, which have higher charges.

BENEFITS: SBI Life-Smart Elite is a flexible plan with various premium payment modes. The system allows the policyholder to increase or reduce the sum assured based on the needs. However, this flexibility is only allowed three times in the entire policy tenure. An increase in the sum assured is subject to underwriting and is not available at 50 years and above. The plan offers a settlement option, under which a policyholder can take away the fund value at maturity in five instalments.

PERFORMANCE: SBI Life-Smart Elite offers a basket of six investment options of which three funds are more than five years old. These include Balanced Fund, Bond Fund and Money Market Fund, while the rest three are recently launched and are just about a year old.

While most of the old funds have outperformed the benchmark with good margins, the new funds are yet to show their sheen.Equity Elite fund is nowhere close to the regular equity fund of SBI Life which is the best performing fund in the category with more than 23% annualised returns. P/E Managed and Index funds, which are equity-oriented funds, have also not put up an encouraging show.

PORTFOLIO REVIEW: SBI Life Insurance primarily has a large-cap defined equity portfolio with just about 4-5% mid-cap stock holding. Top holdings of the portfolio include Infosys, Reliance Industries , ICICI Bank and L&T. Similar to most other funds, SBI Life has a higher exposure to the financial services and oil and gas sectors. The healthcare sector, a more defensive one, forms a small part of the portfolio due to a complex business model, according to the fund manager . The portfolios have very significant exposure in metal stocks, which are currently underperforming.

DEATH / MATURITY BENEFIT: On maturity, the policyholder gets the amount accumulated in the fund. In the case of demise, the nominee of the policyholder receives higher of the sum assured or the fund value or both, subject to a minimum of 105% of the basic total premium paid towards the policy over the period.

For instance, say a 35-year healthy male invests Rs 2,00,000 per annum in the equity fund for 10 years. Assuming that the sum assured is 20 times the annual premium, the total sum assured receivable, in case of any eventuality, would be Rs 40 lakh. By the end of 20 years, assuming the rate of return of 6% and 10%, the fund value shall be Rs 36,65,524 and Rs 67,76,640 respectively.

OUR VIEW: Smart Elite is one of the most competent products in terms of its cost structure. It provides flexibility to investors.

Among its six funds, Balanced and Bond funds have shown a remarkable performance. But high net worth individuals generally have a high risk appetite. Since the returns from the equity-oriented funds in Smart Elite are not as good, prospective investors will be better-off by investing in other products of SBI Life.

Source: [Economic Times]

About the Author

Apply for All type of insurance plans such as Life Insurance, Term Insurance, Endowment Plan, Children Plan and Retirement / Pension Plan visit here: http://www.bimadeals.com

What are the differences between a semi log graph and a regular arithmetic graph? when would you use semi-log?

What are the differences between a semi log graph and a regular arithmetic graph? when would you use semi-log graph

please help thanks

Semi-log graph paper plots logarithms on the Y-axis (ordinate) while the X-axis (abscissa) is arithmetic; arithmetic paper has the same scale on both axes. Semi-log paper can be used to plot larger numbers (like population growth), since the distance between 1 and 10 is the same as between 10 and 100 and the same as between 100 and 1000.

You need to look at examples…

Trig 2.2 Lesson Part 1 Graphs of Equations with Two Variables