Results 81 to 90 of about 9,811 (181)
On the crossing number for Kronecker product of a tripartite graph with path
AKCE International Journal of Graphs and Combinatorics, 2020 The crossing number of a graph G, Cr(G) is the minimum number of edge crossings overall good drawings of G. Among the well-known four standard graph products namely Cartesian product, Kronecker product, strong product and lexicographic product, the one ...
N. Shanthini, J. Baskar Babujee
doaj +1 more source
Food safety risk analysis utilising K-lexicographic-max product of neutrosophic graph
Ain Shams Engineering JournalIn this study, we introduce the concept of the K-Lexicographic Max Product (K−LMP) of neutrosophic graphs and explore its associated degree structure to enhance decision-making frameworks in food safety applications related to risk assessment, including ...
M. Kaviyarasu +5 more
doaj +1 more source
Decomposing certain equipartite graphs into sunlet graphs of length 2p
AKCE International Journal of Graphs and Combinatorics, 2016 For any integer r≥3, we define the sunlet graph of order 2r, denoted L2r, as the graph consisting of a cycle of length r together with r pendant vertices, each adjacent to exactly one vertex of the cycle.
Abolape D. Akwu +1 more
doaj +1 more source
Some Steiner concepts on lexicographic products of graphs
Discrete Mathematics, Algorithms and Applications, 2014 Let G be a graph and W a subset of V(G). A subtree with the minimum number of edges that contains all vertices of W is a Steiner tree for W. The number of edges of such a tree is the Steiner distance of W and union of all vertices belonging to Steiner trees for W form a Steiner interval.
Anand, Bijo S. +3 more
openaire +3 more sources
Shellability, vertex decomposability, and lexicographical products of graphs
Contributions to Discrete Mathematics, 2017 In this note we describe when the independence complex of G[H], the lexicographical product of two graphs G and H, is either vertex decomposable or shellable. As an application, we show that there exists an infinite family of graphs whose independence complexes are shellable but not vertex decomposable.
Meulen, Kevin N. Vander, Van Tuyl, Adam
openaire +2 more sources
Open MathematicsLet SS be a semigroup. In this study, we first introduce the Green’s digraphs and Green’s graphs related to the Green’s relations L{\mathscr{L}}, R{\mathscr{R}}, and J{\mathscr{J}} of SS.
Cheng Yanliang, Shao Yong, Ma Xuanlong
doaj +1 more source
A novel decision-making approach under spherical fuzzy environment
International Journal of Mathematics for IndustryHealth insurance is essential for protecting individuals from rising medical and hospitalization costs, offering crucial financial security, especially as choosing the right plan involves navigating numerous complex and uncertain factors.
Biswajit Some, Anita Pal
doaj +1 more source
Total Coloring Conjecture for Certain Classes of Graphs
Algorithms, 2018 A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color.
R. Vignesh, J. Geetha, K. Somasundaram
doaj +1 more source
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
, 2010 The oriented chromatic number of an oriented graph $\vec G$ is the minimum order of an oriented graph $\vev H$ such that $\vec G$ admits a homomorphism to $\vev H$.
Sopena, Eric
core +1 more source
Lexicographic products and lexicographic powers of graphs -- a walk matrix approach
The characteristic polynomial and the spectrum of the lexicographic product of graphs $H[G]$, a specific instance of the generalized composition (also called $H$-join), are explicitly determined for arbitrary graphs $H$ and $G$, in terms of the eigenvalues of $G$ and an $H[G]$ associated matrix $\widetilde{\bf W}$, which relates $H$ with $G$.
Cardoso, Domingos M. +4 more
openaire +2 more sources