Log in

Relevant bibliographies by topics / Smarandachely signed graph

Contents

Journal articles

Academic literature on the topic 'Smarandachely signed graph'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Smarandachely signed graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Smarandachely signed graph"

1

Reddy, Siva Kota, and S. Vijay. "Total Minimal Dominating Signed Graph." International J.Math. Combin. Vol.3 (May 1, 2010): 11–16. https://doi.org/10.5281/zenodo.9133.

Full text

Abstract:

Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is positive (friendly, like, etc.) or negative (hostile, dislike, etc.). Such a network S is called a signed graph. Signed graphs are much studied in literature because of their extensive use in modeling a variety socio-psychological process and also because of their interesting connections with many classical mat

APA, Harvard, Vancouver, ISO, and other styles

2

Reddy, Siva Kota, V. Lokesha, and B. Prashanth. "Smarandachely t-path step signed graphs." Scientia Magna Vol. 6, No. 3 (2010): 89–92. https://doi.org/10.5281/zenodo.9142.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

P., Siva Kota Reddy, N. Samanta P., and S. Permi Kavita. "On Signed Graphs Whose Two Path Signed Graphs are Switching Equivalent to Their Jump Signed Graphs." January 26, 2015. https://doi.org/10.5281/zenodo.23198.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Nutan, G. Nayak. "Spectra and Energy of Signed Graphs." March 22, 2017. https://doi.org/10.5281/zenodo.815774.

Full text

Abstract:

We extend the notion of extended double cover of graphs to signed graphs to find the spectra of unbalanced signed bipartite graphs and also we construct non-cospectral equienergetic signed bipartite graphs.

APA, Harvard, Vancouver, ISO, and other styles

5

Nutan, G. Nayak. "Spectra and Energy of Signed Graphs." April 29, 2017. https://doi.org/10.5281/zenodo.820901.

Full text

Abstract:

We extend the notion of extended double cover of graphs to signed graphs to find the spectra of unbalanced signed bipartite graphs and also we construct non-cospectral equienergetic signed bipartite graphs.

APA, Harvard, Vancouver, ISO, and other styles

6

P.Siva, Kota Reddy, S.Permi Kavita, and R.Rajanna K. "Combinatorial Aspects of a Measure of Rank Correlation Due to Kendall and its Relation to Complete Signed Digraphs." April 20, 2012. https://doi.org/10.5281/zenodo.814512.

Full text

Abstract:

In this paper, we shall present an account of certain combinatorial aspects of a measure of rank correlation due to Kendall (1938) and point out its relation to the analysis of patterns of preference and indifference which in recent years, have been matters of intense discussion among the social psychologists because of their fundamental role in dealing with certain vital issues of social decision theory.

APA, Harvard, Vancouver, ISO, and other styles

7

Reddy, P.Siva Kota. "Smarandache Directionally n-Signed Graphs — A Survey." October 24, 2013. https://doi.org/10.5281/zenodo.9644.

Full text

Abstract:

For graph theory terminology and notation in this paper we follow the book [3]. All graphs considered here are finite and simple. There are two ways of labeling the edges of a graph by an ordered n-tuple (a1, a2, · · · , an)

APA, Harvard, Vancouver, ISO, and other styles

8

Seema, Mehra, and Singh Manjeet. "Single Valued Neutrosophic Signedgraphs." January 3, 2017. https://doi.org/10.5281/zenodo.1041689.

Full text

Abstract:

Motivated by the notion of single valued neutrosophic graphs defined by Broumi, Talea, Bakali and Smarandache[2] and notion of intuitionistic fuzzy signed graphs defined by Mishra and Pal[8], we introduce the concept of single valued neutrosophic signed graphs and examine the properties of this new concept and examples.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!