Results 1 to 10 of about 105 (94)
Spectral Sufficient Conditions on Pancyclic Graphs
Complexity, 2021 A pancyclic graph of order n is a graph with cycles of all possible lengths from 3 to n. In fact, it is NP-complete that deciding whether a graph is pancyclic.
Guidong Yu +3 more
doaj +2 more sources
Hamilton-Connected Mycielski Graphs∗
Discrete Dynamics in Nature and Society, 2021 Jarnicki, Myrvold, Saltzman, and Wagon conjectured that if G is Hamilton-connected and not K2, then its Mycielski graph μG is Hamilton-connected. In this paper, we confirm that the conjecture is true for three families of graphs: the graphs G with δG>VG ...
Yuanyuan Shen +2 more
doaj +2 more sources
Enumeration of the Edge Weights of Symmetrically Designed Graphs
Journal of Mathematics, 2021 The idea of super a,0-edge-antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses super a,0-edge-antimagic labeling of a biparametric family of pancyclic graphs.
Muhammad Javaid +2 more
doaj +2 more sources
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 An edge-colored graph is \emph{rainbow }if no two edges of the graph have the same color. An edge-colored graph $G^c$ is called \emph{properly colored} if every two adjacent edges of $G^c$ receive distinct colors in $G^c$.
Peixue Zhao, Fei Huang
doaj +1 more source
On the Maximal Graph of a Commutative Ring [PDF]
Mathematics Interdisciplinary Research, 2023 Let $R$ be a commutative ring with nonzero identity. Throughout this paper we explore some properties of two certain subgraphs of the maximal graph of $R$.
Masoumeh Soleimani +2 more
doaj +1 more source
A Theorem on Even Pancyclic Bipartite Digraphs
Mathematical Problems of Computer Science, 2021 We prove a Meyniel-type condition and a Bang-Jensen, Gutin and Li-type condition for a strongly connected balanced bipartite digraph to be even pancyclic. Let D be a balanced bipartite digraph of order 2a ≥ 6.
Samvel Kh. Darbinyan
doaj +1 more source
Panconnectivity algorithm for Eisenstein-Jacobi networks
Kuwait Journal of Science, 2023 The cycles in an interconnection network are one of the communication types that are considered as a factor to measure the efficiency and reliability of the networks’ topology.
Mohammad Awadh +2 more
doaj +1 more source
On regular subgraphs of augmented cubes
AKCE International Journal of Graphs and Combinatorics, 2020 The n-dimensional augmented cube AQn is a variation of the hypercube It is a -regular and -connected graph on vertices. One of the fundamental properties of AQn is that it is pancyclic, that is, it contains a cycle of every length from 3 to In this paper,
Amruta Shinde, Y. M. Borse
doaj +1 more source
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝒫 be a property of a graph. A graph G is said to be locally 𝒫, if the subgraph induced by the open neighbourhood of every vertex in G has property 𝒫. Ryjáček conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
doaj +1 more source
Complement of the generalized total graph of fields
AKCE International Journal of Graphs and Combinatorics, 2020 Let R be a commutative ring and H be a multiplicative prime subset of R. The generalized total graph is the undirected simple graph with vertex set R and two distinct vertices x and y are adjacent if For a field F, is the only multiplicative prime subset
T. Tamizh Chelvam, M. Balamurugan
doaj +1 more source