Zaloguj się

Gotowe bibliografie tematyczne / Smarandachely signed graph

Spis treści

Artykuły w czasopismach

Gotowa bibliografia na temat „Smarandachely signed graph”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Smarandachely signed graph”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

5

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

7

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

Pełny tekst źródła

Streszczenie:

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)

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!