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

ذکر میرا وہ کریں منظور کیوں

ذکر میرا وہ کریں منظور کیوں
جانے وہ الفت سے ہیں معذور کیوں

پوچھتی ہے تم سے یہ میری وفا
جان کر مجھ سے ہوئے رنجور کیوں

آن بیٹھے وہ نظر کے سامنے
قبلہ و کعبہ ہو اب منظور کیوں

ہیں میسر ان کی مست آنکھیں جنھیں
وہ اٹھائیں بادہ و انگور کیوں

تم فضاؔ جب ہو مری محبوب تو
پھر میں دیکھوں حسن کیا اور حور کیوں

تدوین و مشتملات ارتھ شاستر

This paper describes that the Kautiliya Athashastra is the oldest and most exhaustive   treatise on the governance and administration of a state. Starting with the bringing up and education of the young prince, it proceeds to the appointment of ministers and the organization and functioning of various state departments, including the setting up of a secret service. It then sets forth a code of civil and criminal law. In the matter of foreign relations, it puts before the ruler the idea of a "Vijigisu" (would be world conqueror) and discusses in great detail the various situations he may have to face in his dealing with foreign states, whether  friendly or inimical, and points out how he should conduct himself in every case so as to achieve his goal.

Total and Entire Labeling of Graphs

\A plane graph is a particular drawing of a planar graph on the Euclidean plane. Let G(V;E; F) be a plane graph with vertex set V , edge set E and face set F. A proper entire t-colouring of a plane graph is a mapping : V (G) [ E(G) [ F(G) ?! f1; 2; : : : ; tg such that any two adjacent or incident elements in the set V (G)[E(G)[F(G) receive distinct colours. The entire chromatic number, denoted byvef (G), of a plane graph G is the smallest integer t such that G has a proper entire t-colouring. The proper entire t-colouring of a plane graph have been studied extensively in the literature. There are several modi cation on entire t-colouring. We focus on a face irregular entire k-labeling of a 2-connected plane graph as a labeling of vertices, edges and faces of G with labels from the set f1; 2; : : : ; kg in such a way that for any two di erent faces their weights are distinct. The weight of a face under a k-labeling is the sum of labels carried by that face and all the edges and vertices incident with the face. The minimum k for which a plane graph G has a face irregular entire k-labeling is called the entire face irregularity strength". \Another variation to entire t-colouring is a d-antimagic labeling as entire labeling of a plane graph with the property that for every positive integer s, the weights of s-sided faces form an arithmetic sequence with a common di erence d. In the thesis, we estimate the bounds of the entire face irregularity strength for disjoint union of multiple copies of a plane graph and prove the sharpness of the lower bound in two cases. Also we study the existence of d-antimagic labelings for vi the Klein-bottle fullerene that is for anite trivalent graph embedded on the Kleinbottle with each face is a hexagon. In last chapter we investigate the 3-total edge product cordial labeling of hexagonal grid (honeycomb) that is the planar graph with m rows and n columns of hexagons".
Asian Research Index Whatsapp Chanel
Asian Research Index Whatsapp Chanel

Join our Whatsapp Channel to get regular updates.