Results 81 to 90 of about 157 (114)

Metric Dimension of Graphs Djembe (Dj_n)

InPrime Indonesian Journal of Pure and Applied Mathematics
Let G=(V,E) be a connected graph. For an ordered set A⊆V(G), the representation of a vertex with respect to A is defined by its distance vector to the vertices of A.
Duratul Hayat, Des Welyyanti, Haripamyu Haripamyu   +2 more
semanticscholar   +1 more source

On the outer-independent {2}-domination in rooted product graphs

Open Mathematics
Let G be a graph with vertex set V(G). A function f: V(G) → {0, 1, 2} is called an outer-independent {2}-dominating function on G if ∑ u∈N[v] f(u) ≥ 2 for every vertex v ∈ V(G) and {v ∈ V(G) : f(v) = 0} is an independent set of G. The minimum weight ω(f)
Cabrera-Martínez Abel, Conchado-Peiró Andrea, Rodríguez José M.   +2 more
doaj   +1 more source

Characterizations of the Direct Sum of Two Difference - Mean Fuzzy Graphs

Indian Journal of Science and Technology
Objectives: This study presents a new type of fuzzy graph known as the difference mean fuzzy graph by introducing difference mean edge. Methodology: In this paper, difference mean edge in a fuzzy graph is defined by considering the relationship between ...
K. Radha, S. Harini
semanticscholar   +1 more source

The Page Number Problem for Partially Ordered Sets

, 2013
Umieszczenie grafu w książce jest definiowane przez kolejność jego wierzchołków na grzbiecie książki i przyporządkowanie jego krawędzi stronom książki tak, aby na żadnej stronie krawędzie nie przecinały się. Umieszczenie zbioru częściowo uporządkowanego (
Kwiatkowska, Anna Beata
core  

Novel procedures for graph edge-colouring

, 2018
Orientador: Dr. Renato CarmoCoorientador: Dr. André Luiz Pires GuedesTese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática.
Zatesko, Leandro Miranda, 1988-
core  

Shannon Capacity and Related Graph Invariants for Lexicographic Products. [PDF]

Entropy (Basel)
Sason I.
europepmc   +1 more source

COMPUTING SOME DISTANCE – BASED TOPOLOGICAL INDICES OF THE CLUSTER CORONA PRODUCT OF KM AND CN

RCHUB JOURNAL OF COMPUTATIONAL INTELLIGENCE SCIENCE AND ENGINEERING (JCISE)
: Distance-based topological indices are graph invariants that characterize graph structures using vertex distances. In this paper, we derive closed-form expressions for several distance-based topological indices of the cluster product of complete ...
G. K., Maragathavalli S, S. R
semanticscholar   +2 more sources

The security number of lexicographic products

Quaestiones Mathematicae, 2018
A subset S of vertices of a graph G is a secure set if |N[X] ∩ S| ≥ |N[X]−S| holds for any subset X of S, where N[X] denotes the closed neighborhood of X. The minimum cardinality s(G) of a secure set in G is called the security number of G.
Iztok Peterin, Marko Jakovac, Tanja Dravec   +2 more
exaly   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Domination defect for the join and corona of graphs

Applied Mathematical Sciences, 2021
The domination number of a graph G denoted by γ(G) is the minimum number of vertices required to dominate all the vertices of G. The minimality of γ(G) implies that if W ⊆ V (G) such that |W | < γ(G), then there is at least one vertex of G that is not ...
Aldwin T. Rolito G. Eballe, R. Eballe
semanticscholar   +1 more source

Triangular index of some graph products

Applied Mathematical Sciences, 2021
The number of triangles in a graph G is called the triangular index of G, denoted by Ti(G). In this paper we give the exact expressions for the triangular indices of the complete product G ∨ H, corona product G ◦ H, cartesian product G H, and tensor ...
Remarl Joseph M. Damalerio, R. Eballe
semanticscholar   +1 more source