Browse Items (11855 total)
Sort by:
-
Some Variations of Domination in Order Sum Graphs
An order sum graph of a group G, denoted by ? os(G), is a graph with vertex set consisting of elements of G and two vertices say a, b? ? os(G) are adjacent if o(a) + o(b) > o(G). In this paper, we extend the study of order sum graphs of groups to domination. We determine different types of domination such as connected, global, strong, secure, restrained domination and so on for order sum graphs, their complement and line graphs of order sum graphs. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. -
SOME RESULTS ON INJECTIVE CHROMATICS TOPOLOGICAL INDICES OF SOME GRAPHS
Graph coloring is an assignment of colors, labels or weights to the elements of graphs subject to certain conditions. Coloring the vertices of a graph G such that adjacent vertices possessing different colors is the notion of proper coloring. A proper coloring C of a graph G is called an injective coloring of G if any two vertices of G having the same neighbouring vertex have different colors in C. As a coloring analogue to Zagreb indices and irregularity indices in the literature, chromatic Zagreb and irregularity indices have been introduced very recently. In this paper, we introduce the notion of injective chromatic Zagreb indices and injective chromatic irregularity indices and determine these indices for some standard classes of graphs. 2019, RAMANUJAN SOCIETY OF MATHEMATICS AND MATHEMATICAL SCIENCES. All rights reserved. -
Some results on b-chromatic topological indices of some graphs
Graph coloring is assigning weights, integers, or colors to edges, vertices, or both in a graph subject to certain conditions. Proper coloring C of graph G refers to assigning weights, integers, or colors to the vertices, edges, or both so that adjacent vertices or adjacent edges get a different color. A b-coloring follows proper vertex coloring with subject to an additional property that each color class should have at least one vertex with a neighbor in all the other color classes. The notion of Chromatic Zagreb index and irregularity index was introduced recently. This paper introduces the concept of b-Chromatic Zagreb indices and b-Chromatic irregularity indices. Also, we compute these indices for certain standard classes of graphs. 2023 Author(s). -
Some pointers on one way ANOVA in spss /
International journal For Research In Applied Science And engineering Technology, Vol.3, Issue 9, pp.298-301, ISSN No: 2321-9653. -
Some notes on z-scores and t-scores /
International Journal Of Scientific Research And Management, Vol.3, Issue 4, pp.2608-2610, ISSN No: 2321-3418. -
Some New Results on the Rainbow Neighbourhood Number of Graphs
A rainbow neighbourhood of a graph G is the closed neighbourhood N[v] of a vertex v? V(G) which contains at least one coloured vertex of each colour in the chromatic colouring C of G. Let G be a graph with a chromatic colouring C defined on it. The number of vertices in G yielding rainbow neighbourhoods is called the rainbow neighbourhood number of the graph G, denoted by r?(G). Rainbow neighbourhood number of the complements and products of certain fundamental graph classes are discussed in this paper. 2018, The National Academy of Sciences, India. -
Some new results on proper colouring of edge-set graphs
In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding to the family of paths is best suitable for such foundation study. The main result is deriving the chromatic number of the edge-set graph of a path, Pn+1, n ? 1. It is also shown that edge-set graphs for paths are perfect graphs. 2020 the author(s). -
Some New Results on Non-zero Component Graphs of Vector Spaces Over Finite Fields
The non-zero component graph of a vector space with finite dimension over a finite field F is the graph G=(V,E), where vertices of G are the non-zero vectors in V, two of which are adjacent if they have at least one basis vector with non-zero coefficient common in their basic representation. In this paper, we discuss certain properties of the non-zero component graphs of vector spaces with finite dimension over finite fields and their graph invariants. 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. -
Some New Results on Non-inverse Graph of a Group
The non-inverse graph corresponding to a group G, is a simple graph with vertices being elements of the group G and there is an edge between two vertices if they are not mutual inverses. In the current paper, we study few properties of the non-inverse graphs of groups. We also discuss the parameters related different types of domination no.s of the non-inverse graph. We further obtain the Laplacian spectra and signless Laplacian spectra of the non-inverse graphs. 2022 American Institute of Physics Inc.. All rights reserved. -
Some new results on equitable coloring parameters of graphs
An equitable coloring of a graph G is a proper vertex coloring C of G such that the cardinalities of any two color classes in G with respect to C differ by at most one. Coloring the vertices of a graph G subject to given conditions can be considered as a random experiment. In this context, a discrete random variable X can be defined as the color of a vertex chosen at random, with respect to the given type of coloring of G and a probability mass function for this random variable can be defined accordingly. In this paper, we discuss two statistical parameters of the powers of certain graph classes with respect to their equitable colorings. 2019, Univerzita Komenskeho. All rights reserved. -
Some New Results on ?(k) -Coloring of Graphs
Let ? be the minimum number of distinct resources or equipment such as channels, transmitters, antennas and surveillance equipment required for a system's stability. These resources are placed on a system. The system is stable only if the resources of the same type are placed far away from each other or, in other words, they are not adjacent to each other. Let these distinct resources represent different colors assigned on the vertices of a graph G. Suppose the available resources, denoted by k, are less than ?. In that case, placing k resources on the vertices of G will make at least one equipment of the same type adjacent to each other, which thereby make the system unstable. In ?(k)-coloring, the adjacency between the resources of a single resource type is tolerated. The remaining resources are placed on the vertices so that no two resources of the same type are adjacent to each other. In this paper, we discuss some general results on the ?(k)-coloring and the number of bad edges obtained from the same for a graph G. Also, we determine the minimum number of bad edges obtained from ?(k)-coloring of few derived graph of graphs. The number of bad edges which result from a ?(k)-coloring of G is denoted by bk(G). 2023 World Scientific Publishing Company. -
Some interesting case studies using bayes theorem /
International Journal Of Scientific Research, Vol.4, Issue 4, pp.522-523, ISSN No: 2277-8179. -
Some graphs with super vertex sum number 2
In this paper we give optimal super vertex sum labeling scheme for super subdivision of bi-star, path union of spider and algorithm to construct super vertex sum labeling of super subdivision of Caterpillar. 2018 Academic Publications. -
Some examples in usage of parametric tests /
International Journal of Research In Commerce IT And Management., Vol.5, Issue 11, ISSN No: 2231-5736. -
Some characterizations of Gallai graphs
Gallai graph of a graph G is a graph whose vertices are the edges of G and the adjacency of the vertices depends on whether they are part of a triangle or not in G. We find some forbidden subgraph characterization of graphs for which Gallai graph is either a trivially perfect graph or a 3-sun-free graph or an interval graph. 2020 Author(s). -
Some case studies on importance of variables and scales of measurement in social sciences research /
International Advanced Research Journal In Science, Engineering And Technology, Vol.2, Issue 3, pp.34-37, ISSN No: 2393-8021 (Online) 2394-1588 (Print). -
Some case studies for non-parametric tests for ordinal data /
International Journal Of Advanced Research In Engineering Technology & Sciences, Vol.2, Issue 7, pp.309-313, ISSN No: 2394-2819. -
-
Solvent-solute polarity, electrophilic, steric effects, reactive sites, themodynamic quantities discussion and biological evaluation of lung cancer antiproliferative activities of spirobrassinin derivatives
The current study of spirobrassinin and its related compounds, 1-methoxyspirobrassinol and the 5-bromo analogue of methoxyspirobrassinin is performed to reveal a comparison among these molecules to understand which is the most reactive and bioactive. DFT (Density Functional Theory) studies comprising geometry optimisation (energy minimisation), FMO (Frontier Molecular Orbital) Analysis, theoretical UV analysis, NLO (Non-Linear Optics), NBO (Natural Bond Orbital) and thermodynamics studies are performed using Gaussian 09W. IEFPCM model is employed to investigate the solvent effect on the reactivity and stability of the title compounds. ADME profiles are generated using SwissADME, PreADMET and ADMETLab 2.0. Interesting lung cancer target proteins are docked with the title compounds is finally performed to obtain insight into the molecules' anticancer potential. 2023 Elsevier B.V.