D-branes provide a simple framework for embedding semi-realistic chiral gauge theories within String Theory. Some of these stringy setups admit a higher dimensional field theory description in terms of open string wavefunctions. These play a role analogous to vertex operators in CFT, allowing to compute 4d low energy observables in terms of overlap integrals. In this contribution we briefly rev...

We have measured the B hadron energy distribution in Z 0 decays using a sample of semi-leptonic B decays recorded in the SLD experiment at SLAC. The energy of each tagged B hadron was reconstructed using information from the lepton and a partially-reconstructed charm-decay vertex. We compared the scaled energy distribution with several models of heavy quark fragmentation. The average scaled ene...

Let GG =(V,E)(V,E) be a simple graph. A subset SS is said to Semi-Strong if for every vertex vv in VV, |N(v)∩S|≤1|N(v)∩S|≤1, or no two vertices of have the same neighbour that is, are joined by path length VV. The minimum cardinality semi-strong partition called chromatic number and denoted χsGχsG. proper colour dominator dominates some class, , adjacent with element class. In this paper, inste...

I discuss algorithms for constructing constrained Delaunay triangulations (CDTs) in dimensions higher than two. If the CDT of a set of vertices and constraining simplices exists, it can be constructed in O(nvns) time, where nv is the number of input vertices and ns is the number of output d-simplices. The CDT of a starshaped polytope can be constructed in O(ns log nv) time, yielding an efficien...

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...

The vertex arboricity $rho(G)$ of a graph $G$ is the minimum number of subsets into which the vertex set $V(G)$ can be partitioned so that each subset induces an acyclic graph‎. ‎A graph $G$ is called list vertex $k$-arborable if for any set $L(v)$ of cardinality at least $k$ at each vertex $v$ of $G$‎, ‎one can choose a color for each $v$ from its list $L(v)$ so that the subgraph induced by ev...

recently, hua et al. defined a new topological index based on degrees and inverse ofdistances between all pairs of vertices. they named this new graph invariant as reciprocaldegree distance as 1{ , } ( ) ( ( ) ( ))[ ( , )]rdd(g) = u v v g d u  d v d u v , where the d(u,v) denotesthe distance between vertices u and v. in this paper, we compute this topological index forgrassmann graphs.

This paper is concerned with a problem on networks which we call the Generalized Subgraph Problem (GSP). The GSP is defined on an undirected graph where the vertex set is partitioned into clusters. The task is to find a subgraph which touches at most one vertex in each cluster so as to maximize the sum of vertex and edge weights. The GSP is a relaxation of several important problems of a ‘gener...

In this research paper, it was studied about degree of vertices of a semitotal blocks in fuzzy graphs. In process we obtain some interesting results regarding the degree of the vertices in semitotal blocks in fuzzy graphs. We observed that when ‘B’ is a block of a given fuzzy graph G:(V, σ, μ), then degree of the vertex B in semi total block fuzzy graph TSTBF(G) is equal to the sum of the membe...

The infinite configuration space of an integrable vertex model based on Uq gl(2|2) 1 is studied at q = 0. Allowing four particular boundary conditions, the infinite configurations are mapped onto the semi-standard supertableaux of pairs of infinite border strips. By means of this map, a weight-preserving one-to-one correspondence between the infinite configurations and the normal forms of a pai...