Results 61 to 70 of about 1,270,493 (107)
On the Odd Gracefulness of Cyclic Snakes With Pendant Edges
, 2012 Graceful and odd gracefulness of a graph are two entirely different concepts. A graph may posses one or both of these or neither. We present four new families of odd graceful graphs.
E. M. Badr (4977650), E. M. Badr
core +1 more source
Graceful Labeling on Grids in 3-Dimensions and 4-Dimensions
, 2007 優美標號(Graceful labeling)最早是由Rosa在1966年提出。一個graph G上的端點標號(vertex labeling)所指的是一個vertex的函數f對應到一些數值(即標號)，而G上的每一edge xy 被指定一個由f(x)和f(y)所決定的數值。如果這樣的一個f:V-->{0,1,...|E|}是單射，且指定 edge xy 的數值為|f(x)-f(y)|而所有的edge都被指定不同的數值，則f被稱為一個優美標號。 Rosa提出假說猜測所有的tree都有優美標號 ...
Chen, Yi-xian, 陳奕先
core
On super vertex-graceful unicyclic graphs [PDF]
, 2009 summary:A graph $G$ with $p$ vertices and $q$ edges, vertex set $V(G)$ and edge set $E(G)$, is said to be super vertex-graceful (in short SVG), if there exists a function pair $(f, f^+)$ where $f$ is a bijection from $V(G)$ onto $P$, $f^+$ is a bijection
Lee, Sin-Min, Ng, Ho Kuen, Leung, Elo
core
Further results on super graceful labeling of graphs
, 2016 Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G)∪E(G)→{k,k+1,k+2,…,k+p+q−1} such that f(uv)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G.
Ho-Kuen Ng, Wai Chee Shiu, Gee-Choon Lau
core +1 more source
88th Annual Meeting of the Meteoritical Society 2026: Abstracts
Meteoritics &Planetary Science, Volume 61, Issue S1, Page S48-S551, August 2026.
wiley +1 more source
On odd-graceful coloring of graphs
For a graph G(V, E) which is undirected, simple, and finite, we denote by |V | and |E| the cardinality of the vertex set V and the edge set E of G, respectively. A graceful labeling f for the graph G is an injective function f : V → {0, 1, 2, . . . , |E|}
I. Nengah Suparta (21320564) +3 more
core
A PROCEDURE FOR DERIVING ODD-GRACEFUL CHROMATIC NUMBERS OF GRAPHS
Let \(G:=(V,E)\) be an undirected finite simple graph with vertex set \(V\) and edge set \(E\). A function \(c:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\), such that \(c(u)\neq c(v)\) for every edge \(uv\in E(G)\), is called a ...
I Nengah Suparta +3 more
core +1 more source
A Metaheuristic Approach to the Graceful Labeling Problem
, 2010 In graph theory, a graceful labeling of a graph G = (V, E) with n vertices and m edges is a labeling of its vertices with distinct integers between 0 and m inclusive, such that each edge is uniquely identified by the absolute difference between its ...
Houra Mahmoudzadeh, Kourosh Eshghi
core +1 more source
Cranial osteology of the pampathere Holmesina floridanus (Xenarthra: Cingulata; Blancan NALMA), including a description of an isolated petrosal bone. [PDF]
PeerJ, 2017 Gaudin TJ, Lyon LM.
europepmc +1 more source