Results 11 to 20 of about 285,444 (268)
Journal of Combinatorial Theory, Series B, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zang, W, Ding, G
openaire +4 more sources
-super antimagic total labeling of comb product of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 Let and be two simple, nontrivial and undirected graphs. Let be a vertex of , the comb product between and , denoted by , is a graph obtained by taking one copy of and copies of and grafting the th copy of at the vertex to the th vertex of .
Ika Hesti Agustin +2 more
doaj +1 more source
Graphs and Combinatorics, 2016 The maximum cardinality of an induced $2$-regular subgraph of a graph $G$ is denoted by $c_{\rm ind}(G)$. We prove that if $G$ is an $r$-regular graph of order $n$, then $c_{\rm ind}(G) \geq \frac{n}{2(r-1)} + \frac{1}{(r-1)(r-2)}$ and we prove that if $G$ is a cubic claw-free graph on order $n$, then $c_{\rm ind}(G) > 13n/20$ and this bound is ...
Michael A. Henning +3 more
openaire +3 more sources
DIMENSI METRIK KETETANGGAAN LOKAL GRAF HASIL OPERASI k-COMB
Contemporary Mathematics and Applications (ConMathA), 2019 Research on the local adjacency metric dimension has not been found in all operations of the graph, one of them is comb product graph. The purpose of this research was to determine the local adjacency metric dimension of k-comb product graph and level ...
Fryda Arum Pratama +2 more
doaj +1 more source
Vertices with the second neighborhood property in Eulerian digraphs [PDF]
Opuscula Mathematica, 2019 The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property.
Michael Cary
doaj +1 more source
A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs
Journal of Mathematical and Fundamental Sciences, 2013 A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes.
A. N.M. Salman +2 more
doaj +1 more source
Discrete Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lou Caccetta, K. Vijayan
openaire +1 more source
Minimal unavoidable sets of cycles in plane graphs [PDF]
Opuscula Mathematica, 2018 A set \(S\) of cycles is minimal unavoidable in a graph family \(\cal{G}\) if each graph \(G \in \cal{G}\) contains a cycle from \(S\) and, for each proper subset \(S^{\prime}\subset S\), there exists an infinite subfamily \(\cal{G}^{\prime}\subseteq\cal{
Tomáš Madaras, Martina Tamášová
doaj +1 more source
Rainbow Cycles in Flip Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 The flip graph of triangulations has as vertices all triangulations of a convex $n$-gon, and an edge between any two triangulations that differ in exactly one edge. An $r$-rainbow cycle in this graph is a cycle in which every inner edge of the triangulation appears exactly $r$ times. This notion of a rainbow cycle extends in a natural way to other flip
Stefan Felsner +3 more
openaire +6 more sources
Geodesic bipancyclicity of the Cartesian product of graphs
Theory and Applications of Graphs, 2022 A cycle containing a shortest path between two vertices $u$ and $v$ in a graph $G$ is called a $(u,v)$-geodesic cycle. A connected graph $G$ is geodesic 2-bipancyclic, if every pair of vertices $u,v$ of it is contained in a $(u,v)$-geodesic cycle of ...
Amruta Shinde, Y.M. Borse
doaj +1 more source