Results 21 to 30 of about 5,608,609 (280)
Hamiltonian-connected self-complementary graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carrillo, Luis D., Luis D. Carrillo
openaire +3 more sources
The Spectrum of Weighted Lexicographic Product on Self-Complementary Graphs
The lexicographic product, a powerful binary operation in graph theory, offers methods for creating a novel graph by establishing connections between each vertex of one graph and every vertex of another.
Xiaoxiao Zhang, Zenghui Fang
doaj +1 more source
Hadwiger Numbers of Self-complementary Graphs [PDF]
6 pages, 4 figures, 1 ...
Andrei Pavelescu, Elena Pavelescu
openaire +4 more sources
Equienergetic self-complementary graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Indulal, G., Vijayakumar, A.
openaire +1 more source
Let G(V,X) be a finite and simple graph of order n and size m. The complement of G, denoted by G¯, is the graph obtained by removing the lines of G and adding the lines that are not in G.
Amrithalakshmi Pai +4 more
doaj +1 more source
Powers of cycle graph which are k-self complementary and k-co-self complementary
E. Sampath Kumar and L. Pushpalatha [4] introduced a generalized version of complement of a graph with respect to a given partition of its vertex set. Let G = (V,E) be a graph and P = {V₁, V₂,...,Vk} be a partition of V of order k ≥ 1.
Sudhakara , G. +2 more
core +1 more source
Triple Connected Domination Number of a Graph [PDF]
The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
A Study of Complex Dombi Fuzzy Graph With Application in Decision Making Problems
A complex fuzzy set (CFS) is a generalization of a fuzzy set (FS) in which a limit of degrees occurs on the complex plane with unit disc. The averaging operators are a key part of turning all the data into one value.
Ehsan Mehboob Ahmed Butt +4 more
doaj +1 more source
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source
Directed graph iterated function systems [PDF]
This thesis concerns an active research area within fractal geometry. In the first part, in Chapters 2 and 3, for directed graph iterated function systems (IFSs) defined on ℝ, we prove that a class of 2-vertex directed graph IFSs have attractors that ...
Boore, Graeme C.
core +2 more sources

