Elements of Geometry and Trigonometry |
From inside the book
Results 1-5 of 75
Page 2382
... vertices. of. BSV. Neutrosophic. Graphs. T. Siva Nageswara Rao1 , Ch. Shashi Kumar2, Y. Srinivasa Rao3, V. Venkateswara Rao4 1&4 Division of Mathematics, Vignan's Foundation for Science Technology & Research (Deemed to be University) ...
... vertices. of. BSV. Neutrosophic. Graphs. T. Siva Nageswara Rao1 , Ch. Shashi Kumar2, Y. Srinivasa Rao3, V. Venkateswara Rao4 1&4 Division of Mathematics, Vignan's Foundation for Science Technology & Research (Deemed to be University) ...
Page
... vertices , regarded as elements of { J } , when c increases from a negative value through the value a . By minor adjustments of the a's it can be arranged that ( c ) never passes simultaneously through two vertices . Various general ...
... vertices , regarded as elements of { J } , when c increases from a negative value through the value a . By minor adjustments of the a's it can be arranged that ( c ) never passes simultaneously through two vertices . Various general ...
Page 6
... vertices provided that n ≥ 2 and m ≥ 2 (see also Lemma 2.10 below). Moreover, for any n ≥ 2, Kn ∨K2 has exactly n S-vertices. Note that a graph containing a Smarandache vertex should have at least four vertices and three edges and ...
... vertices provided that n ≥ 2 and m ≥ 2 (see also Lemma 2.10 below). Moreover, for any n ≥ 2, Kn ∨K2 has exactly n S-vertices. Note that a graph containing a Smarandache vertex should have at least four vertices and three edges and ...
Page 10
... vertices and edges are among the vertices and edges of the other graph, which is called the containing graph. 20 6. A cut-vertex19 is a vertex A of a graph for which the remaining vertices can be partitioned into two groups P and Q ...
... vertices and edges are among the vertices and edges of the other graph, which is called the containing graph. 20 6. A cut-vertex19 is a vertex A of a graph for which the remaining vertices can be partitioned into two groups P and Q ...
Page 6
... vertices if these two vertices are in the path . A hypergraph is connected if any pair of vertices is connected , otherwise it is disconnected . The distance between two vertices is the minimum length of the path connecting these two ...
... vertices if these two vertices are in the path . A hypergraph is connected if any pair of vertices is connected , otherwise it is disconnected . The distance between two vertices is the minimum length of the path connecting these two ...
Other editions - View all
Common terms and phrases
ABCD AC² adjacent angles altitude angle ACB apothem Applying logarithms base and altitude bisect centre chord circle circumference circumscribed coincide cone consequently convex surface corresponding cosec cosine Cotang cylinder denote diagonals diameter distance divided draw drawn edges equally distant feet find the area Formula frustum given angle given line given point greater hence homologous hypothenuse included angle interior angles intersection less Let ABC log sin logarithm lower base mantissa mean proportional measured by half middle point number of sides opposite parallel parallelogram parallelopipedon perimeter perpendicular plane MN polyedral angle polyedron prism PROBLEM PROPOSITION proved pyramid quadrant radii radius rectangle regular polygons right angles right-angled triangle Scholium secant segment side BC similar sine slant height sphere spherical polygon spherical triangle square Tang tangent THEOREM triangle ABC triangular prisms triedral angle upper base vertex vertices whence