Results 51 to 60 of about 473,067 (264)

On average connectivity of the strong product of graphs

open access: yesDiscrete Applied Mathematics, 2013
Generalitat de Cataluña 1298 ...
Encarnación Abajo   +3 more
openaire   +4 more sources

Intuitionistic Fuzzy Graphs with Categorical Properties

open access: yesFuzzy Information and Engineering, 2015
The main purpose of this paper is to show the rationality of some operations, defined or to be defined, on intuitionistic fuzzy graphs. Firstly, three kinds of new product operations (called direct product, lexicographic product, and strong product) are ...
Hossein Rashmanlou   +3 more
doaj   +1 more source

Weak reconstruction of strong product graphs

open access: yesDiscrete Mathematics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blaz Zmazek, Janez Zerovnik
openaire   +2 more sources

The Restricted Edge-Connectivity of Strong Product Graphs

open access: yesAxioms
The restricted edge-connectivity of a connected graph G, denoted by λ′(G), if it exists, is the minimum cardinality of a set of edges whose deletion makes G disconnected, and each component has at least two vertices.
Hazhe Ye, Yingzhi Tian
doaj   +1 more source

Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian

open access: yesContemporary Mathematics and Applications (ConMathA), 2020
The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered about strong local metric dimension are path graph, star graph, complete ...
Nurma Ariska Sutardji   +2 more
doaj   +1 more source

Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair
Kuziak Dorota   +2 more
doaj   +1 more source

Complex Vague Graphs and Their Application in Decision-Making Problems

open access: yesIEEE Access, 2020
Fuzzy graph models are found everywhere in natural and human made structures, including process dynamics in biological, physical and social systems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is ...
Shouzhen Zeng   +4 more
doaj   +1 more source

The general position problem and strong resolving graphs

open access: yesOpen Mathematics, 2019
The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj   +1 more source

A Multiplicative Version of Forgotten Topological Index [PDF]

open access: yesMathematics Interdisciplinary Research, 2019
In this paper, we present upper bounds for the multiplicative forgotten topological index of several graph operations such as sum, Cartesian product, corona product, composition, strong product, disjunction and symmetric difference in terms of the F ...
Asghar Yousefi   +3 more
doaj   +1 more source

Edge-connectivity of strong products of graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2007
The strong product G1 £G2 of graphs G1 and G2 is the graph with V (G1) × V (G2) as the vertex set, and two distinct vertices (x1, x2) and (y1, y2) are adjacent whenever for each i ∈ {1, 2} either xi = yi or xiyi ∈ E(Gi). In this note we show that for two connected graphs G1 and G2 the edge-connectivity λ(G1£G2) equals min{δ(G1£ G2), λ(G1)(|V (G2)|+2|E ...
Brešar, Boštjan, Špacapan, Simon
openaire   +3 more sources

Home - About - Disclaimer - Privacy