CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS

Authors

  • Muhammad Akram Department of Mathematics, University of the Punjab, New Campus, Lahore, Pakistan
  • Neha Waseem Department of Mathematics, University of the Punjab, New Campus, Lahore, Pakistan
  • Wieslaw A. Dudek Faculty of Pure and Applied Mathematics, Wroclaw University of Science and Technology, Wyb. Wyspianskiego 27, 50-370, Wroclaw, Poland
Abstract:

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. We discuss the relationship between degree of a vertex and degree of an edge in an $m-$polar fuzzy graph. We investigate edge irregularity on a path on $2n$ vertices and barbell graph $B_{n,n}.$We also present an application of $m-$polar fuzzy graph to decision making.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

m-polar intuitionistic graphs and its properties

In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...

full text

ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS

Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...

full text

Some isomorphic properties of m-polar fuzzy graphs with applications

The theory of graphs are very useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we present a frame work to handle m-polar fuzzy information by combining the theory of m-polar fuzzy sets with graphs. We introduce the notion of weak self complement m-polar fuzzy graphs and establish a necessary condition...

full text

on the edge cover polynomial of certain graphs

let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...

full text

A Study on Edge-Set Graphs of Certain Graphs

LetG(V,E) simple connected graph, with |E| = . In this paper, we define an edge-set graph GG constructed from the graphG such that any vertex vs,i of GG corresponds to the i-th s-element subset ofE(G) and any two vertices vs,i, vk,m of GG are adjacent if and only if there is at least one edge in the edge-subset corresponding to vs,i which is adjacent to at least one edge in the edge-subset corr...

full text

Twin edge colorings of certain square graphs and product graphs

A twin edge k-coloring of a graph G is a proper edge k-coloring of G with the elements of Zk so that the induced vertex k-coloring, in which the color of a vertex v in G is the sum in Zk of the colors of the edges incident with v, is a proper vertex k-coloring. The minimum k for which G has a twin edge k-coloring is called the twin chromatic index of G. Twin chromatic index of the square P 2 n ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 14  issue 4

pages  27- 50

publication date 2017-08-30

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023