303 research outputs found
MH2-055 - Adat 55 Balai Indu
No full textIban weaving. 1989 Balai Indu'. Tenun 2 bala indu. . Language as given
Independent strong domination number of indu-bala product of graphs
No full textA set D⊂ V be the strong dominating set of G if every vertex in V − D is strongly dominated by at least one vertex in D. The strong domination number γst(G) of G is the minimum cardinality of a strong dominating set. The independent strong domination number is(G) of a graph G is the minimum cardinality of a strong dominating set which is independent. In this paper, by means of the degree sequences (DS) of graphs and some graph theoretical methods, we determine the independent strong domination number of Indu-Bala product of simple connected graphs and null graphs
Independent strong domination number of indu-bala product of graphs
No full textA set D⊂ V be the strong dominating set of G if every vertex in V − D is strongly dominated by at least one vertex in D. The strong domination number γst(G) of G is the minimum cardinality of a strong dominating set. The independent strong domination number is(G) of a graph G is the minimum cardinality of a strong dominating set which is independent. In this paper, by means of the degree sequences (DS) of graphs and some graph theoretical methods, we determine the independent strong domination number of Indu-Bala product of simple connected graphs and null graphs
Distance spectrum of Indu–Bala product of graphs
No full textAbstractThe D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D-spectrum of G denoted by SpecD(G). Let G1 and G2 be two regular graphs. The Indu–Bala product of G1 and G2 is denoted by G1▾G2 and is obtained from two disjoint copies of the join G1∨G2 of G1 and G2 by joining the corresponding vertices in the two copies of G2. In this paper we obtain the distance spectrum of G1▾G2 in terms of the adjacency spectra of G1 and G2. We use this result to obtain a new class of distance equienergetic graphs of diameter 3. We also prove that the class of graphs Kn¯▾Kn+1¯ has integral distance spectrum
Computation of Polynomial Degree-Based Topological Descriptors of Indu-Bala Product of Two Paths
No full textCheminformatics is entirely a newly coined term that encompasses a field that includes engineering computer sciences along with basic sciences. As we all know, vertices and edges form a network whereas vertex and its degrees contribute to joining edges. The degree of vertex is very much dependent on a reasonable proportion of network properties. There is no doubt that a network has to have a reliance of different kinds of hub buses, serials, and other connecting points to constitute a system that is the backbone of cheminformatics. The Indu-Bala product of two graphs G1 and G2 has a special notation as described in Section 2. The attainment of this product is very much due to related vertices at to different places of G1∨G2. This study states we have found M-polynomial and degree-based topological indices for Indu-Bala product of two paths Pk and Pj for j,k≥2. We also give some graphical representation of these indices and analyzed them graphically
Transmission and reciprocal transmission topological indices and co-indices of Indu-Bala products of graphs
No full textThe transmission of a vertex u in a connected graph G is denoted by s(?) and defined by [Formula presented]; that is, the sum of the distances between u and all other vertices of a graph G. The reciprocal transmission of a vertex u in a connected graph G is denoted by rs(u) and defined by [Formula presented]; that is, the sum of the reciprocal of distances between u and all other vertices of a graph G. In this paper we obtain explicit formulae for various transmission and reciprocal transmission based topological indices and co-indices of Indu-Bala product of graphs
Unveiling the obsession: Exercise addiction among female amateur runners in Delhi-NCR and the power of unwavering commitment
No full textAim and Objective: This study was intended for a possible relationship that might exist between exercise addiction and unbending commitment among female amateur runners. Exercise addiction (EA) can be characterized as an obsession with physical activity; Materials and Methods: The “purposive sampling method” was utilized to collect data. The inventories taken for this purpose were “The Exercise Addiction Inventory” and “Commitment Running Scale.” The questionnaire was filled out by 100 participants aged between 18 and 50 years from the capital of India and its border area (Delhi and NCR). Results and Conclusion: It was found that 39% of female long-distance runners were exercise addicts, and 72% were highly committed to running, supporting a probable reason for EA
Anaesthesia for cesarean section in a parturient with complicated intracerebral aneurysm following unsuccessful endovascular coiling
No full text
The Tale of a Choreographer, Her student, River and an endangered Heritage: Indu Mitha’s Qaseeda-i-Ilm of Jamal/ “An Ode to Wisdom and Beauty”
No full textChoreographing in Pakistan since the 50’s, the country’s senior most 90+ years young classical dance maestro Indu Mitha has made trailblazing contributions within the Kalakshtera Bharata Natyam using North Indian music, interesting and contemporary content, while also producing more tableau forms of dance.
In one of her recent solo pieces in the later style, titled “Qaseeda-i-Ilm of Jamal” or “An Ode to Wisdom and Beauty” Indu engages with symbolisms of a Hindu goddess of knowledge and Aesthetics_Saraswati and pays tribute to a forgotten dried up river of the same name. Indu Mitha allows the author, for whom and on whose body the dance is made, to bring in the forgotten river in her engagement with people’s histories of the land of present-day Pakistan and eventually facilitates her accessing of and embodying a pluralistic space of inter faith harmony which was occluded
- …
