Results 51 to 60 of about 9,546 (165)
The study of odd graceful and odd strongly harmonious for bipartite graph
, 2020 11 pages,6 ...
Wang, Xiuying +3 more
openaire +2 more sources
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
A note on "Folding wheels and fans." [PDF]
, 2012 In S.Gervacio, R.Guerrero and H.Rara, Folding wheels and fans, Graphs and Combinatorics 18 (2002) 731-737, the authors obtain formulas for the clique numbers onto which wheels and fans fold.
Kloks, Ton, Wang, Yue-Li
core
The role of identification in data‐driven policy iteration: A system theoretic study
International Journal of Robust and Nonlinear Control, EarlyView.Abstract The goal of this article is to study fundamental mechanisms behind so‐called indirect and direct data‐driven control for unknown systems. Specifically, we consider policy iteration applied to the linear quadratic regulator problem. Two iterative procedures, where data collected from the system are repeatedly used to compute new estimates of ...
Bowen Song, Andrea Iannelli
wiley +1 more source
Even-Odd Harmonious Labeling of Certain Family of Cyclic Graphs
International Journal of Innovative Technology and Exploring Engineering, 2020 An even-odd harmonious labeling of a graph G with p vertices and q edges is a process of assigning odd numbers 1,3,5,...,2q 1 to the vertices through a 1-1 computing function f and even numbers 0, 2, 4,..., 2( p 1) to the edges through a bijective computing function f * with the condition that f *(e uv) ( f (u) f (v))(mod 2q) where u and v are ...
M. Kalaimathi*, Dr. B. J. Balamurugan
openaire +1 more source
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
Odd Harmonious Labeling of Lotus Flower Graphs
CAUCHY: Jurnal Matematika Murni dan AplikasiThe purpose of the research is to obtain the construction of a new graph class definition and the new graph class satisfies the properties of odd harmonious labeling. The research method consists of a preliminary stage, namely the stage of finding open problems, the stage of analyzing data for the formation of definitions and theorems, the stage of ...
Fery Firmansah +2 more
openaire +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
New Families of Odd Harmonious Graphs
, 2014 Dans cet article, nous montrons que le nombre d'arêtes pour tout graphe eulérien harmonieux impair est congruent à 0 ou 2 (mod 4), et nous avons trouvé un contre-exemple pour l'inverse de cette affirmation n'est pas vrai. Nous avons également prouvé que, les graphiques qui sont construits par deux copies de cycle pair Cn partageant une arête commune ...
openaire +1 more source