Results 31 to 40 of about 1,699 (154)
Enumeration of the Edge Weights of Symmetrically Designed Graphs
Journal of Mathematics, Volume 2021, Issue 1, 2021., 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. We also present the aforesaid labeling on the disjoint union of graphs comprising upon copies of C4 and different trees.
Muhammad Javaid +3 more
wiley +1 more source
PANCYCLICITY IN LINE GRAPHS [PDF]
Acta Mathematica Scientia, 1998 For a graph \(G\), let \(\overline {\sigma}_2\) denote min\(\{ d(u) + d(v)\mid uv \in E(G) \}\). The author shows that if \(G\) is connected and of order \(n \geq 43\) such that the line graph \(L(G)\) is Hamiltonian and \(\overline {\sigma}_2> 2(n/5 - 1)\), then \(L(G)\) is pancyclic. This settles a conjecture of Benhocine et al. For a connected graph
Daniela Ferrero, Linda Lesniak
openaire +6 more sources
\((n−2)\)-Fault-Tolerant Edge-Pancyclicity of Möbius Cubes \(MQ_n\) [PDF]
Ars Comb.The \( n \)-dimensional Möbius cube \( MQ_n \) is an important variant of the hypercube \( Q_n \), which possesses some properties superior to the hypercube. This paper investigates the fault-tolerant edge-pancyclicity of \( MQ_n \), and shows that if \(
Huifeng Zhang +4 more
openalex +2 more sources
A SUFFICIENT CONDITION FOR PANCYCLIC GRAPHS
Bulletin of the Australian Mathematical SocietyAbstract A graph G is called an $[s,t]$ -graph if any induced subgraph of G of
Xingzhi Zhan
openalex +3 more sources
Discrete Applied Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Randerath, Bert +3 more
openaire +1 more source
Journal of Graph Theory, 1998 Summary: In generalizing the concept of a pancyclic graph, we say that a graph is ``weakly pancyclic'' if it contains cycles of every length between the length of a shortest and a longest cycle. In this paper it is shown that in many cases the requirements on a graph which ensure that it is weakly pancyclic are considerably weaker than those required ...
Stephan Brandt +2 more
openalex +3 more sources
Regular Hypertournaments and Arc‐Pancyclicity [PDF]
Journal of Graph Theory, 2016 AbstractAk‐hypertournamentHonnvertices () is a pair, whereVis the vertex set ofHandAis a set ofk‐tuples of vertices, called arcs, such that for all subsetswith,Acontains exactly one permutation ofSas an arc. Recently, Li et al. showed that any strongk‐hypertournamentHonnvertices, where, is vertex‐pancyclic, an extension of Moon's theorem for ...
Michel Surmacs
openalex +3 more sources
Journal of Combinatorial Theory, Series B, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bollobás, Béla, Thomason, Andrew
openaire +2 more sources
Forbidden subgraphs that imply Hamiltonian-connectedness [PDF]
, 1999 It is proven that if $G$ is a $3$-connected claw-free graph which is also $Z_3$-free (where $Z_3$ is a triangle with a path of length $3$ attached), $P_6$-free (where $P_6$ is a path with $6$ vertices) or $H_1$-free (where $H_1$ consists of two disjoint ...
Broersma, H.J. +4 more
core +7 more sources
Computing Edge Weights of Magic Labeling on Rooted Products of Graphs
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain ...
Jia-Bao Liu +3 more
wiley +1 more source