We define quality differential coordinates (QDC) for per-vertex encoding of the quality of a tetrahedral mesh. QDC measures the deviation of a mesh vertex from a position which maximizes the combined quality of the set of tetrahedra incident at that vertex. Our formulation allows the incorporation of different choices of element quality metrics into QDC construction to penalize badly shaped and...

A semi strong outer mod sum labeling of a graph G is an injective mapping f : V (G) → Z+ with an additional property that for each vertex v of G, there exist vertices w1, w2 in V (G) such that f(w1) = ∑ u∈N(v) f(u) and f(v) = ∑ u∈N(w2) f(u), where both the sums are taken under addition modulo m for some positive integer m. A graph G which admits a semi strong outer mod sum labeling is called a ...

Angular distribution of the secondary lepton in top-quark production followed by subsequent semi-leptonic decay is studied assuming general top-quark couplings. It is shown that the distribution does not depend on any possible anomalous tbW couplings and is determined only by the standard V −A decay vertex for any production mechanism if certain well-justified conditions are satisfied. PACS: 13...

Classification learning problem on hypergraph is an extension of multi-label classification problem on normal graph, which divides vertices on hypergraph into several classes. In this paper, we focus on the semi-supervised learning framework, and give theoretic analysis for spectral based hypergraph vertex classification semi-supervised learning algorithm. The generalization bound for such algo...

‎let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an‎ ‎acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors‎. ‎we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$‎. ‎we also determine‎ ‎exact value of this parameter for the cartesian product of ...

in this paper, at first we mention to some results related to pi and vertex co-pi indices and then we introduce the edge versions of co-pi indices. then, we obtain some properties about these new indices.

a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...

let g_1 and g_2 be simple connected graphs with disjoint vertex sets v(g_1) and v(g_2), respectively. for given vertices a_1in v(g_1) and a_2in v(g_2), a splice of g_1 and g_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the :union: of g_1 and g_2. in this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

The vertex version of PI index is a molecular structure descriptor which is similar to vertex version of Szeged index. In this paper, we compute the vertex-PI index of TUC4C8(S), TUC4C8(R) and HAC5C7[r, p].