Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0412424

Basic Neutrosophic Algebraic Structures and their Application to Fuzzy and Neutrosophic Models

W. B. Vasantha Kandasamy·Florentin Smarandache
View original source ↗Read source document ↗Export metadata ↓

Abstract

The involvement of uncertainty of varying degrees when the total of the membership degree exceeds one or less than one, then the newer mathematical paradigm shift, Fuzzy Theory proves appropriate. For the past two or more decades, Fuzzy Theory has become the potent tool to study and analyze uncertainty involved in all problems. But, many real-world problems also abound with the concept of indeterminacy. In this book, the new, powerful tool of neutrosophy that deals with indeterminacy is utilized. Innovative neutrosophic models are described. The theory of neutrosophic graphs is introduced and applied to fuzzy and neutrosophic models. This book is organized into four chapters. In Chapter One we introduce some of the basic neutrosophic algebraic structures essential for the further development of the other chapters. Chapter Two recalls basic graph theory definitions and results which has interested us and for which we give the neutrosophic analogues. In this chapter we give the application of graphs in fuzzy models. An entire section is devoted for this purpose. Chapter Three introduces many new neutrosophic concepts in graphs and applies it to the case of neutrosophic cognitive maps and neutrosophic relational maps. The last section of this chapter clearly illustrates how the neutrosophic graphs are utilized in the neutrosophic models. The final chapter gives some problems about neutrosophic graphs which will make one understand this new subject.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

W. B. Vasantha Kandasamy, Florentin Smarandache. 2004-12-21. Basic Neutrosophic Algebraic Structures and their Application to Fuzzy and Neutrosophic Models. https://arxiv.org/abs/math/0412424

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗