Accesso libero

Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme

INFORMAZIONI SU QUESTO ARTICOLO

Cita

A. K. Kel’mans, Properties of the characteristic polynomial of a graph, Kibernetiky na Slŭ Kommunizmu, Emergija, Markova-Leningrand, 4(1967), 27-41(in Russian). Search in Google Scholar

B. Prashanth, K. Nagendra Naik, K. R. Rajanna, A remark on eigen values of Signed graph, Journal of Applied Mathematics, Statistics and Informatics15(1) (2019), 33-42. (ISSN (print): 1336-9180,(ISSN (on-line): 1339-0015, Poland)). Search in Google Scholar

C. S. Oliveria, N. M. Maia de Abreu, S. Jurkiewicz, The Characteristic Polynomial of the Laplacian of graphs in(a,b)-linear classes, Linear Algebra and its Applications. 356,113-121 (2002), (ISSN:0024-3795). Search in Google Scholar

D. Cvetkovic, P. Rowlinson, S. Simi’c: An Introduction to the Theory of Graph Spectra. Cambridge University Press, Cambridge(2010). Search in Google Scholar

F. Harary, R. Z. Norman and D. W. Cartwright, Structural models: An introduction to the theory of directed graphs, Wiley Inter-Science, Inc., New York, 1965. Search in Google Scholar

F. Harary, Graph Theory, Addison-Wesley Publishing Co., 1969. Search in Google Scholar

F. Harary, On the notion of balance of a signed graph, Michigan Math. J., 2(1953), 143-146. Search in Google Scholar

F. Harary and J. A. Kabell, Counting balanced signed graphs using marked graphs, Proc. Edinburgh Math. Soc., 24 (2)(1981), 99-104. Search in Google Scholar

F. Belardo and S. K. Simic, On the Laplacian coe cients of signed graphs, Linear ALgebra and its Applications,475 (2015), 94-113. (ISSN:0024-3795). Search in Google Scholar

G. T. Chartrand, Graphs as Mathematical Models, Prindle, Weber & Schmidt, Inc., Boston, Massachusetts 1977. Search in Google Scholar

G. Davis, G. Chen, F. Hall, Z. Li, M. Stewart and K. Patel, An interlacing result on normalized Laplacian, SIAM J. Discrete Math. 18(2004),353-361. Search in Google Scholar

I. M. Mladenov, M. D. Kotarov and J. G. Vassileva Popova, Method for Computing the Characteristic Polynomial, International Journal of Quantum Chemistry. 10(8),339-341 (1980), (ISSN:0020-7608-80). Search in Google Scholar

J. P. Grossman, An eigenvalue bound for the Laplacian of a graph, Discrete Math. 300 (2005), 225-228. Search in Google Scholar

M. J. Rosenberg and R. P. Abelson, Symbolic psycho-logic: A model of attitudinal cognition, Behav. Sci., volume 3, p. 1-13(1958). Search in Google Scholar

T. Zaslavsky, signed graphs, Discrete Appl. Math., 4(1)(1982), 47-74. Search in Google Scholar

Y. Hou, Y. Pan and J. Li On the Laplacian Eigenvalues of signed graphs, Linear and Multilinear Algebra,(2003) p. 21-30. Search in Google Scholar

F. R. K. Chung, Counting balanced signed graphs using marked graphs, Proc. Edinburgh Math. Soc., 24 (2)(1981), 99-104. Search in Google Scholar

eISSN:
1339-0015
Lingua:
Inglese
Frequenza di pubblicazione:
2 volte all'anno
Argomenti della rivista:
Computer Sciences, Information Technology, Mathematics, Logic and Set Theory, Probability and Statistics, Applied Mathematics