Search from the Journals, Articles, and Headings
Advanced Search (Beta)
Loading...
Loading...
Loading...
Loading...
Loading...
Loading...

جاڑے کا موسم

جاڑے کا موسم

جاڑے کا موسم حیرت سے
میرا منہ تکتا رہتا ہے

کیسے اُس کی لمبی راتیں
کیسے اُس کی ٹھنڈی راتیں
میں تنہا ہی کاٹ رہا ہوں

وہ کیا جانے میرے دل کو
میں اُس کی لمبی راتوں میں
میں اُس کی ٹھنڈی راتوں میں
بھول کے چاند بھی جاڑے کا میں
کمرے اندر بیٹھ کے بس میں
یاد تمہیں کرتا رہتا ہوں

جاڑے کا موسم حیرت سے
میرا منہ تکتا رہتا ہے

A Videogrammetric Analysis of On Peak/Off Peak Traffic Density: A Case of Board Bazaar Peshawar

The increasing population is a growing issue in densely populated cities, which leads to an increase in transportation services. In this paper travel time delay due to stationary bottleneck was observed throughout the week in one of the densely populated cities of Pakistan i.e. Peshawar. Videogrammetry was implemented to obtain the recorded frames through the various days of the week. The recorded frames were then statistically analyzed to identify the travel delays in Board Bazaar Peshawar at a stationary bottleneck using SPSS and Statgraphics Software. The statistical analysis revealed a direct proportionality between traffic density and travel time, whereas an inverse proportionality was identified between traffic speed and traffic density. A high traffic density was observed on working days, whereas on the non-working days a reduced traffic density was observed. This study recommends a predictive target lane vehicular guidance system for a smooth traffic flow.

On Irregular Total Labelings

A labeling of a graph is a map that carries graph elements to the numbers (usually positive or non-negative integers). The most common choices of domain are the set of all vertices (vertex labelings), the edge set alone (edge labelings), or the set of all vertices and edges (total labelings). In many cases, it is interesting to consider the sum of all labels associated with a graph element. It is called the weight of the element: the weight of a vertex or the weight of an edge. In this thesis, we consider a total k-labeling as a labeling of the vertices and edges of graph G with labels from the set {1, 2, . . . , k}. A total k-labeling is defined to be an edge irregular total k-labeling of the graph G if edge-weights are different for all pairs of distinct edges and to be a vertex irregular total k-labeling of G if vertex-weights are different for all pairs of distinct vertices. The minimum value of k for which the graph G has an edge irregular total k- labeling is called the total edge irregularity strength of the graph G, tes(G). Analo- gously, the total vertex irregularity strength of G, tvs(G), is defined as the minimum k for which there exists a vertex irregular total k-labeling of G. In this thesis, we present new results on the total edge irregularity strength and the total vertex irregularity strength.
Asian Research Index Whatsapp Chanel
Asian Research Index Whatsapp Chanel

Join our Whatsapp Channel to get regular updates.