Incidence cuts and connectivity in fuzzy incidence graphs
نویسندگان
چکیده مقاله:
Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy incidence graphs are introduced in this article. Their relationships withfuzzy connectivity parameters are discussed and results similar to Whitney’s theorems are obtained. Also, the incidenceis used to model flows in human trafficking networks.
منابع مشابه
Incidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملrandic incidence energy of graphs
let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...
متن کاملIncidence Posets and Cover Graphs
We prove two theorems concerning incidence posets of graphs, cover graphs of posets and a related graph parameter. First, answering a question of Haxell, we show that the chromatic number of a graph is not bounded in terms of the dimension of its incidence poset, provided the dimension is at least four. Second, answering a question of Kříž and Nešetřil, we show that there are graphs with large ...
متن کاملIncidence Choosability of Graphs
An incidence of a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident with v. Two incidences (v, e) and (w, f) of G are adjacent whenever (i) v = w, or (ii) e = f , or (iii) vw = e or f . An incidence p-colouring of G is a mapping from the set of incidences of G to the set of colours {1, . . . , p} such that every two adjacent incidences receive distinct colours. In...
متن کاملOn path graphs of incidence graphs
For a given graph G and a positive integer k the Pk-path graph Pk(G) has for vertices the set of paths of length k in G. Two vertices are connected in Pk(G) when the intersection of the corresponding paths forms a path of length k − 1 in G, and their union forms either a cycle or a path of length k + 1. Path graphs were proposed as a generalization of line graphs. In this article we investigate...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 16 شماره 2
صفحات 31- 43
تاریخ انتشار 2019-03-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023