Characterizations of Strong and Balanced Neutrosophic Complex Graphs
نویسندگان
چکیده
منابع مشابه
Strong Neutrosophic Graphs and Subgraph Topological Subspaces
In this book authors for the first time introduce the notion of strong neutrosophic graphs. They are very different from the usual graphs and neutrosophic graphs. Using these new structures special subgraph topological spaces are defined. Further special lattice graph of subgraphs of these graphs are defined and described. Several interesting properties using subgraphs of a strong neutrosophic ...
متن کاملComplex Neutrosophic Graphs of Type 1
In this paper, we introduced a new neutrosophic graphs called complex neutrosophic graphs of type1 (CNG1) and presented a matrix representation for it and studied some properties of this new concept. The concept of CNG1 is an extension of generalized fuzzy graphs of type 1 (GFG1) and generalized single valued neutrosophic graphs of type 1 (GSVNG1).
متن کاملOn minimal forbidden subgraph characterizations of balanced graphs
A graph is balanced if its clique-matrix contains no edge-vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs ...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.10.21290