Results 51 to 60 of about 101,128 (285)
DIAMETER OF THE DIRECT PRODUCT OF WIELANDT GRAPH [PDF]
Korean Journal of Mathematics, 2012 Summary: A digraph \(D\) is primitive if there is a positive integer \(k\) such that there is a walk of length \(k\) between arbitrary two vertices of \(D\). The exponent of a primitive digraph is the least such \(k\). Wielandt graph \(W_n\) of order \(n\) is known as the digraph whose exponent is \(n^2 - 2 n + 2\), which is the maximum of all the ...
Kim, Sooyeon, Song, Byung Chul
openaire +2 more sources
Direct product of picture fuzzy hypersoft graphs. [PDF]
, 2023 Risk evaluation has always been of great interest for individuals wanting to invest in various businesses, especially in the marketing and product sale centres.
Ibrahim Mekawy (14755646) +3 more
core +1 more source
Chromatic Number of Fuzzy Graphs: Operations, Fuzzy Graph Coloring, and Applications
Axioms, 2022 We focus on fuzzy graphs with crisp vertex sets and fuzzy edge sets. This paper introduces a new concept of chromatic number (crisp) for a fuzzy graph G˜(V,E˜).
Zengtai Gong, Jing Zhang
doaj +1 more source
Vertex-Transitive Direct Products of Graphs
The Electronic Journal of Combinatorics, 2018 It is known that for graphs $A$ and $B$ with odd cycles, the direct product $A\times B$ is vertex-transitive if and only if both $A$ and $B$ are vertex-transitive. But this is not necessarily true if one of $A$ or $B$ is bipartite, and until now there has been no characterization of such vertex-transitive direct products.
Richard H. Hammack, Wilfried Imrich
openaire +2 more sources
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2007 In this paper we study the graphs which are direct product of a simple graph G with the graphs obtained by the complete graph Kk adding a loop to each vertex; thus these graphs turn out to be a generalization of the double graphs.
Zagaglia Salvi, Norma +1 more
doaj +1 more source
On optimizing edge connectivity of product graphs [PDF]
, 2011 This work studies the super edge connectivity and super restricted edge connectivity of direct product graphs, Cartesian product graphs, strong product graphs and lexicographic product graphs.
Jianping Ou, Ou, Jianping
core +1 more source
The irregularity of graphs under graph operations
Discussiones Mathematicae Graph Theory, 2014 The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj +1 more source
The NEPS of Gain Graphs over Arbitrary Groups and its Spectra [PDF]
Advances in Group Theory and ApplicationsWe provide two definitions for a gain function on a non-complete extended p-sum (NEPS) of gain graphs over arbitrary groups. In the first one, the gain function takes values in the direct product of the gain groups of the factors.
Matteo Cavaleri +2 more
doaj +1 more source
Generalized Petersen graphs and Kronecker covers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The family of generalized Petersen graphs $G(n,k)$, introduced by Coxeter et al. [4] and named by Mark Watkins (1969), is a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. The
Matjaž Krnc, Tomaž Pisanski
doaj +1 more source
Enumerating cliques in direct product graphs [PDF]
Journal of Combinatorics, 2020 5 pages, 1 ...
openaire +2 more sources