Vertex Connectivity of Fuzzy Graphs with Applications to Human Trafficking

2018 ◽  
Vol 14 (03) ◽  
pp. 457-485 ◽  
Author(s):  
Shanookha Ali ◽  
Sunil Mathew ◽  
John N. Mordeson ◽  
Hossein Rashmanlou
Keyword(s):  
Real Number ◽  
Human Trafficking ◽  
Dynamic Network ◽  
Arbitrary Real Number ◽  
Fuzzy Graph ◽  
Vertex Connectivity ◽  
The Past ◽  
Fuzzy Graphs ◽  
Number Formula ◽  
Fuzzy Vertex

Connectivity is the most important aspect of a dynamic network. It has been widely studied and applied in different perspectives in the past. In this paper, constructions of [Formula: see text]-connected fuzzy graphs for an arbitrary real number [Formula: see text] and average fuzzy vertex connectivity of fuzzy graphs are discussed. Average fuzzy vertex connectivity of fuzzy trees, fuzzy cycles and complete fuzzy graphs are studied. The concept of a uniformly [Formula: see text]-connected fuzzy graph is introduced and characterized towards the end. An application related to human trafficking is also discussed.

scholarly journals Generalized Fuzzy Graph Connectivity Parameters with Application to Human Trafficking

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 424
Author(s):  
Arya Sebastian ◽  
John N Mordeson ◽  
Sunil Mathew
Keyword(s):  
Human Trafficking ◽  
Network Theory ◽  
Graph Connectivity ◽  
Fuzzy Graph ◽  
Graph Models ◽  
Edge Connectivity ◽  
Clustering Techniques ◽  
New Class ◽  
Large Size ◽  
Fuzzy Graphs

Graph models are fundamental in network theory. But normalization of weights are necessary to deal with large size networks like internet. Most of the research works available in the literature have been restricted to an algorithmic perspective alone. Not much have been studied theoretically on connectivity of normalized networks. Fuzzy graph theory answers to most of the problems in this area. Although the concept of connectivity in fuzzy graphs has been widely studied, one cannot find proper generalizations of connectivity parameters of unweighted graphs. Generalizations for some of the existing vertex and edge connectivity parameters in graphs are attempted in this article. New parameters are compared with the old ones and generalized values are calculated for some of the major classes like cycles and trees in fuzzy graphs. The existence of super fuzzy graphs with higher connectivity values are established for both old and new parameters. The new edge connectivity values for some wider classes of fuzzy graphs are also obtained. The generalizations bring substantial improvements in fuzzy graph clustering techniques and allow a smooth theoretical alignment. Apart from these, a new class of fuzzy graphs called generalized t-connected fuzzy graphs are studied. An algorithm for clustering the vertices of a fuzzy graph and an application related to human trafficking are also proposed.

scholarly journals Coloring picture fuzzy graphs through their cuts and its computation

2021 ◽  
Vol 7 (1) ◽  
pp. 63
Author(s):  
Isnaini Rosyida ◽  
Suryono Suryono
Keyword(s):  
Fuzzy Set ◽  
Intuitionistic Fuzzy Set ◽  
Fuzzy Graph ◽  
Chromatic Numbers ◽  
The Third ◽  
Fuzzy Graphs ◽  
Picture Fuzzy Set ◽  
Definition Of ◽  
Fuzzy Vertex ◽  
Matlab Programming

In a fuzzy set (FS), there is a concept of alpha-cuts of the FS for alpha in [0,1]. Further, this concept was extended into (alpha,delta)-cuts in an intuitionistic fuzzy set (IFS) for delta in [0,1]. One of the expansions of FS and IFS is the picture fuzzy set (PFS). Hence, the concept of (alpha,delta)-cuts was developed into (alpha,delta,beta)-cuts in a PFS where beta is an element of [0,1]. Since a picture fuzzy graph (PFG) consists of picture fuzzy vertex or edge sets or both of them, we have an idea to construct the notion of the (alpha,delta,beta)-cuts in a PFG. The steps used in this paper are developing theories and algorithms. The objectives in this research are to construct the concept of (alpha,delta,beta)-cuts in picture fuzzy graphs (PFGs), to construct the (alpha,delta,beta)-cuts coloring of PFGs, and to design an algorithm for finding the cut chromatic numbers of PFGs. The first result is a definition of the (alpha,delta,beta)-cut in picture fuzzy graphs (PFGs) where (alpha,delta,beta) are elements of a level set of the PFGs. Further, some properties of the cuts are proved. The second result is a concept of PFG coloring and the chromatic number of PFG based on the cuts. The third result is an algorithm to find the cuts and the chromatic numbers of PFGs. Finally, an evaluation of the algorithm is done through Matlab programming. This research could be used to solve some problems related to theories and applications of PFGs.

scholarly journals Fuzzy Chromatic Polynomial of Fuzzy Graphs with Crisp and Fuzzy Vertices Using α-Cuts

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Mamo Abebe Ashebo ◽  
V. N. Srinivasa Rao Repalle
Keyword(s):  
Optimization Problems ◽  
Real Life ◽  
Chromatic Polynomial ◽  
Fuzzy Graph ◽  
Traffic Light ◽  
Chromatic Polynomials ◽  
Combinatorial Optimization Problems ◽  
Fuzzy Graphs ◽  
Vertex Set ◽  
Fuzzy Vertex

Coloring of fuzzy graphs has many real life applications in combinatorial optimization problems like traffic light system, exam scheduling, register allocation, etc. In this paper, the concept of fuzzy chromatic polynomial of fuzzy graph is introduced and defined based on α-cuts of fuzzy graph. Two different types of fuzziness to fuzzy graph are considered in the paper. The first type was fuzzy graph with crisp vertex set and fuzzy edge set and the second type was fuzzy graph with fuzzy vertex set and fuzzy edge set. Depending on this, the fuzzy chromatic polynomials for some fuzzy graphs are discussed. Some interesting remarks on fuzzy chromatic polynomial of fuzzy graphs have been derived. Further, some results related to the concept are proved. Lastly, fuzzy chromatic polynomials for complete fuzzy graphs and fuzzy cycles are studied and some results are obtained.

Results on Vague Graphs with Applications in Human Trafficking

2018 ◽  
Vol 14 (01) ◽  
pp. 37-52 ◽  
Author(s):  
E. Darabian ◽  
R. A. Borzooei
Keyword(s):  
Human Trafficking ◽  
Fuzzy Graph ◽  
Fuzzy Graphs ◽  
Vague Graph

A vague graph is a generalized structure of a fuzzy graph that gives more precision, exibility, and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, the concepts of eccentricity of nodes, radius and diameter of vague graphs are introduced. The special types of graphs such as eccentrice and antipodal vague graphs are investigated. Then, the relation between eccentrice and antipodal vague graphs are discussed. Finally, an application of eccentrice and antipodal vague graphs in human traffickingn studied.

Energy of spherical fuzzy graphs

2020 ◽  
pp. 321-332
Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali
Keyword(s):  
Adjacency Matrix ◽  
Upper Bounds ◽  
Fuzzy Graph ◽  
Lower And Upper Bounds ◽  
Fuzzy Graphs

In this paper, the notion of energy extended to spherical fuzzy graph. The adjacency matrix of a spherical fuzzy graph is defined and we compute the energy of a spherical fuzzy graph as the sum of absolute values of eigenvalues of the adjacency matrix of the spherical fuzzy graph. Also, the lower and upper bounds for the energy of spherical fuzzy graphs are obtained.

On Laplacian energy of picture fuzzy graphs in site selection problem

2021 ◽  
pp. 1-18
Author(s):  
Mahima Poonia ◽  
Rakesh Kumar Bajaj
Keyword(s):  
Decision Making ◽  
Site Selection ◽  
Upper Bounds ◽  
Selection Problem ◽  
Hydropower Plant ◽  
Fuzzy Graph ◽  
Fuzzy Information ◽  
Fuzzy Graphs ◽  
Laplacian Energy ◽  
Selection For

In the present work, the adjacency matrix, the energy and the Laplacian energy for a picture fuzzy graph/directed graph have been introduced along with their lower and the upper bounds. Further, in the selection problem of decision making, a methodology for the ranking of the available alternatives has been presented by utilizing the picture fuzzy graph and its energy/Laplacian energy. For the shake of demonstrating the implementation of the introduced methodology, the task of site selection for the hydropower plant has been carried out as an application. The originality of the introduced approach, comparative remarks, advantageous features and limitations have also been studied in contrast with intuitionistic fuzzy and Pythagorean fuzzy information.

scholarly journals Bringing the problem home: The anti-slavery and anti-trafficking rhetoric of UK non-government organisations

Politics ◽  
2020 ◽  
pp. 026339572096240
Author(s):  
Nick Turnbull ◽  
Rose Broad
Keyword(s):  
Human Trafficking ◽  
Policy Framing ◽  
Female Victims ◽  
Policy Problem ◽  
The Past ◽  
Problem Framing ◽  
Labour Exploitation ◽  
Modern Slavery ◽  
Problem Frame ◽  
Historical Rhetoric

Rhetoric is a way to explain policy problem framing by recognising the practical necessity to persuade audiences in contextual situations. Modern slavery and human trafficking is a complex and emotive problem, simplified through rhetorical demands to motivate an audience of supporters. This article analyses rhetoric by 212 UK anti-trafficking and anti-slavery non-government organisations (NGOs) to uncover rhetorical practices and their effects on policy framing, supplemented by archival research to compare past and present anti-slavery oratory. Our data show NGOs use rhetoric to motivate supporters and promote a humanitarian problem frame, in opposition to a state-driven security frame. Findings confirm other research in identifying an emphasis on female victims and on sexual over labour exploitation. Past and present rhetoric are equivalent in terms of liberal, Christian values (ethos) and appeals to pathos through sympathy for victims. Historical rhetoric is distinctive in arguing for the equal human status of slaves, whereas contemporary activists argue victims are denied agency. Contemporary rhetoric represses the question of migration, whereas past rhetoric is more deliberative. Rhetoric varies with the requirements of persuasion related to contextual distance, between unlike humans in the past, but in regard to geographical distance today.

scholarly journals Complement of max product of intuitionistic fuzzy graphs

2021 ◽  
Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali
Keyword(s):  
Hamming Distance ◽  
Fuzzy Graph ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Graphs ◽  
Degree Of A Vertex ◽  
Intuitionistic Fuzzy Graphs

AbstractIn this paper, the complement of max product of two intuitionistic fuzzy graphs is defined. The degree of a vertex in the complement of max product of intuitionistic fuzzy graph is studied. Some results on complement of max product of two regular intuitionistic fuzzy graphs are stated and proved. Finally, we provide an application of intuitionistic fuzzy graphs in school determination using normalized Hamming distance.

On the kth root partition function

2021 ◽  
pp. 1-15
Author(s):  
Ya-Li Li ◽  
Jie Wu
Keyword(s):  
Partition Function ◽  
Positive Integer ◽  
Asymptotic Formula ◽  
Real Number ◽  
Number Of Solutions ◽  
Asymptotic Development ◽  
Number Formula

For any positive integer [Formula: see text], let [Formula: see text] be the number of solutions of the equation [Formula: see text] with integers [Formula: see text], where [Formula: see text] is the integral part of real number [Formula: see text]. Recently, Luca and Ralaivaosaona gave an asymptotic formula for [Formula: see text]. In this paper, we give an asymptotic development of [Formula: see text] for all [Formula: see text]. Moreover, we prove that the number of such partitions is even (respectively, odd) infinitely often.

scholarly journals Applications of Fuzzy Graph Theory Portrayed in Various Fields

2021 ◽  
Author(s):  
Abdul Muneera ◽  
T. Nageswara Rao ◽  
R. V. N. Srinivasa ◽  
J. Venkateswara Rao
Keyword(s):  
Graph Theory ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Material Science ◽  
Natural Sciences ◽  
Wireless Sensor ◽  
Fuzzy Graph ◽  
Ecological Conditions ◽  
Fuzzy Graphs ◽  
Remote System

Abstract The intend of the paper is to grant the centrality of fuzzy graph (f-graph) hypothetical ideas and the uses of dominations in fuzzy graphs to different genuine circumstances in the territories of science and designing. It is seen an eminent development because of various applications in PC and correspondence, biomedical, atomic material science and science, interpersonal organizations, natural sciences and in different various regions. Interpersonal organizations are the zones where countless individuals are associated. A wireless sensor Network (WSN) remote system which comprises of spatially circulated independent sensors to screen the physical or ecological conditions, for example, pressure, temperature, sound and so forth and to communicate their data through the remote system to a fundamental area. This paper gives an audit of the employments of Fuzzy Graph theory in different sorts of fields.

Sign in / Sign up

Export Citation Format

Share Document