Some Invariants of Jahangir Graphs
نویسندگان
چکیده
Mobeen Munir 1, Waqas Nazeer 1, Shin Min Kang 2,3, Muhammad Imran Qureshi 4, Abdul Rauf Nizami 1 and Youl Chel Kwun 5,* 1 Division of Science and Technology, University of Education, Lahore 54000, Pakistan; [email protected] (M.M.); [email protected] (W.N.); [email protected] (A.R.N.) 2 Department of Mathematics and Research Institute of Natural Science, Gyeongsang National University, Jinju 52828, Korea; [email protected] 3 Center for General Education, China Medical University, Taichung 40402, Taiwan 4 COMSATS Institute of Information Technology, Vehari Campus, Vehari, 61100 Pakistan; [email protected] 5 Department of Mathematics, Dong-A University, Busan 49315, Korea * Correspondence: [email protected]; Tel.: +82-51-200-7216
منابع مشابه
Applications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
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.
متن کاملA Cycle or Jahangir Ramsey Unsaturated Graphs
A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number, and Ramsey saturated otherwise. We present some result concerning both Ramsey saturated and unsaturated graph. In particular, we show that a cycle Cn and a Jahangir Jm Ramsey unsaturated or saturated graphs of R(Cn,Wm) and R(Pn, Jm), respectively. We also suggest an open problems.
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملRelative non-Normal Graphs of a Subgroup of Finite Groups
Let G be a finite group and H,K be two subgroups of G. We introduce the relative non-normal graph of K with respect to H , denoted by NH,K, which is a bipartite graph with vertex sets HHK and KNK(H) and two vertices x ∈ H HK and y ∈ K NK(H) are adjacent if xy / ∈ H, where HK =Tk∈K Hk and NK(H) = {k ∈ K : Hk = H}. We determined some numerical invariants and state that when this graph is planar or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Symmetry
دوره 9 شماره
صفحات -
تاریخ انتشار 2017