1,721,114 research outputs found
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
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
