Results 31 to 40 of about 1,632,039 (225)
Anytime system level verification via parallel random exhaustive hardware in the loop simulation [PDF]
, 2016 System level verification of cyber-physical systems has the goal of verifying that the whole (i.e., software + hardware) system meets the given specifications.
MANCINI, Toni +4 more
core +1 more source
Graceful Labelling of Corona Product of Aster Flower Graph
, 2018 There are many graph labelling that have been developed, one of which is a graceful labelling. A graceful labelling of a graph G = (V, E) with E edges is an injectivef: V(G) → {0, 1, ...
Elvi Khairunnisa, K. Sugeng
semanticscholar +1 more source
An Adiabatic Quantum Algorithm for Determining Gracefulness of A Graph
, 2016 Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph $G$ with $e$ edges, is to label the vertices of $G$ with $0, 1, \cdots, e$ such that, if we specify to each edge the difference value between
Darareh, Mahdi Davoudi +3 more
core +1 more source
One curious identity counting graceful labelings
Enumerative Combinatorics and Applications, 2021 Let $a$ and $b$ be positive integers with prime factorisations $a = p_1^np_2^n$ and $b = q_1^nq_2^n$. We prove that the number of essentially distinct $α$-graceful labelings of the complete bipartite graph $K_{a, b}$ equals the alternating sum of fourth powers of binomial coefficients $(-1)^n[\binom{2n}{0}^4 - \binom{2n}{1}^4 + \binom{2n}{2}^4 - \binom{
openaire +3 more sources
Graceful And Graceful Labeling Of Graphs
, 2018 {"references": ["1.\tJ. A. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinatory 16 (2009).DS6. 2.\tI. Gutman, The energy of a graph, Ber. Math-satist. sekt. Forschungsz. Graz 103 (1978), 1-22. 3.\tGutman and B. Zhou, Laplacian energy of a graph, linear algebra appl. 414 (2006), 29-37. 4.\tI.
M. Soundharya, R. Balakumar
openaire +1 more source
Topological Integer Additive Set-Sequential Graphs
, 2015 Let $\mathbb{N}_0$ denote the set of all non-negative integers and $X$ be any non-empty subset of $\mathbb{N}_0$. Denote the power set of $X$ by $\mathcal{P}(X)$. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $
Augustine, Germina +2 more
core +2 more sources
, 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
A Study on Integer Additive Set-Valuations of Signed Graphs [PDF]
, 2015 Let $\N$ denote the set of all non-negative integers and $\cP(\N)$ be its power set. An integer additive set-labeling (IASL) of a graph $G$ is an injective set-valued function $f:V(G)\to \cP(\N)-\{\emptyset\}$ such that the induced function $f^+:E(G) \to
Germina, K. A., Sudev, N. K.
core +4 more sources
Graceful labeling of hexagonal snakes [PDF]
AIP Conference Proceedings, 2019 Consider a graph G with p number of vertices and q number of edges. If the edges of the graph are labeled by subtracting the corresponding vertex label of the respective edges following the condition that the labels of the vertices and edges are distinct is known as Graceful labeling of a graph.
Lalitha Pattabiraman +2 more
openaire +1 more source
On the graceful polynomials of a graph [PDF]
, 2019 Every graph can be associated with a family of homogeneous polynomials, one for every degree, having as many variables as the number of vertices. These polynomials are related to graceful labellings: a graceful polynomial with all even coefficients is a
Andrea Vietri
core