Filters








16,697 Hits in 3.6 sec

On magic graphs

Suresh Manjanath Hegde, Sudhakar Shetty
2003 The Australasian Journal of Combinatorics  
The minimum of all constants say, m(G), where the minimum is taken over all such bijections of a magic graph G, is called the magic strength of G.  ...  In this paper we define the maximum of all constants say, M (G), analogous to m(G), and introduce strong magic, ideal magic, weak magic labelings, and prove that some known classes of graphs admit such  ...  We call m(G) the minimum magic strength of a magic graph G, and analogously we define the maximum magic strength, M (G), as the maximum of all c(f ).  ... 
dblp:journals/ajc/HegdeS03 fatcat:n4766nbgtfa7bjpbbbxuriauoy

Page 9594 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
Also, we obtain a bound on the magic strength of the path-union P,,(m) and on the relaxed-magic strength of kS,, and kP,,.” 2004m:05234 05C78 Nicholas, T.  ...  In this paper, we introduce almost-magic labeling, relaxed-magic labeling, almost-magic strength and relaxed-magic COMBINATORICS 9594 strength of a graph.  ... 

Premises on fuzzy factorizable perfect intrinsic edge-magic graphs

Kaliraja M., Sasikala M.
2019 Malaya Journal of Matematik  
In this paper we introduced the order, size and strength of factorizable perfect intrinsic edge-magic graphs. Also we examined these concepts in fuzzy cycle, banner, path & star graphs.  ...  A fuzzy graph G is said to be perfect intrinsic edge-magic if it satisfies the perfect intrinsic edge-magic labelling with intrinsic super constant I s .  ...  In [8] , the topic of edge-magic labelling of graphs had its foundation in the work of Kotzig and Rosa on what they called magic valuations of graphs.  ... 
doi:10.26637/mjm0704/0022 fatcat:7pf5kuumhfdtpcn4iimzx44zyu

On Complementary Edge Magic Labeling ofCertain Graphs

Sanjay Roy, D.G. Akka
2012 American Journal of Mathematics and Statistics  
By G(p, q) we denote a graph having p vertices and q edges, by V(G) and E(G) the vertex set and the edge -  ...  function of the cycle C 4l+2 with the magic constant k =2(3n-5l-2)= (7n+2)/2 Complementary edge magic strength: Let G = nР 2 be a regular graph of degree one.  ...  A graph(p, q) is said to have an edge magic with the magic constant k (which is independent on the choice of any edge uv of G) if there exists a one one-to -one mapping f:V(G) U E(G)  {1, 2, p+q} such  ... 
doi:10.5923/j.ajms.20120203.02 fatcat:5kzfq4vxlvg33pdynntvczawwa

On Complementary Edge Magic Labeling of Certain Graphs

Sanjay Roy, D.G. Akka
2012 American Journal of Mathematics and Statistics  
By G(p, q) we denote a graph having p vertices and q edges, by V(G) and E(G) the vertex set and the edge -  ...  function of the cycle C 4l+2 with the magic constant k =2(3n-5l-2)= (7n+2)/2 Complementary edge magic strength: Let G = nР 2 be a regular graph of degree one.  ...  A graph(p, q) is said to have an edge magic with the magic constant k (which is independent on the choice of any edge uv of G) if there exists a one one-to -one mapping f:V(G) U E(G)  {1, 2, p+q} such  ... 
doi:10.5923/j.ajms.20110101.04 fatcat:tuuu27jjurfodbelgl2g27ynfy

A Fuzzy proper bi-magic labeling on tadpole graph

Bharathi T, Felixia S
2021 Journal of computational mathematics  
The property of Fuzzy Bi-Magic of Tadpole graph is the sum of the labels on the vertices and the labels of their incident edges is one of the constants either k1 or k2 but k2 is unique  ...  The perception of Fuzzy Proper Bi-Magic labeling for Tadpole Graph also-ran newly derived and the properties of fuzzy bi-magic of Tadpole graph has been discussed.  ...  Properties of The Fuzzy Proper Bi-magic Graph For every Fuzzy proper bi-magic graph G, there exists at least one Fuzzy bridge.  ... 
doi:10.26524/cm98 fatcat:uhq3bzjspfaydb4lvuyma64bya

Novel Properties of Fuzzy Labeling Graphs

A. Nagoor Gani, Muhammad Akram, D. Rajalaxmi (a) Subahashini
2014 Journal of Mathematics  
We have shown that the removal of a fuzzy bridge from a fuzzy magic cycle with odd nodes reduces the strength of a fuzzy magic cycle.  ...  The concepts of fuzzy labeling and fuzzy magic labeling graph are introduced. Fuzzy magic labeling for some graphs like path, cycle, and star graph is defined.  ...  Conflict of Interests The authors declare that they do not have any conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2014/375135 fatcat:vt37j3tedbbmjknp3zege43tae

Super magic strength of a graph

D. G. Akka, Nanda S. Warad
2010 Indian journal of pure and applied mathematics  
In this paper, we introduced the concept of super magic and super magic strength of a graph.  ...  The super edge magic strength of a graph G, sm(G) is defined as the minimum of all c(f ) where the minimum is taken over all super edge magic labeling f of G if there exists at least one such super edge  ... 
doi:10.1007/s13226-010-0031-z fatcat:ofvpgowvonf2dmbgosfmg6ruyu

Bounds of Strong EMT Strength for certain Subdivision of Star and Bistar

Salma Kanwal, Ayesha Riasat, Mariam Imtiaz, Zurdat Iftikhar, Sana Javed, Rehana Ashraf
2018 Open Mathematics  
A super edge-magic total (SEMT) labeling of a graph ℘(V, E) is a one-one map ϒ from V(℘)∪E(℘) onto {1, 2,...  ...  The super edge-magic total (SEMT) strength, sm(℘), of a graph ℘ is the minimum of all magic constants a(ϒ), where the minimum runs over all the SEMT labelings of ℘.  ...  The research contents of this paper are partially supported by HEC (5420/Federal/NRPU/R & D/HEC/2016).  ... 
doi:10.1515/math-2018-0111 fatcat:bvmb2paavzbotctdq5ncigvqfu

Magic Type Labeling of Graphs in Linear Ordering Problems

Marina Semeniuta, Zoya Sherman, Oleh Dmitriiev, Mykhailo Soroka
2021 International Scientific Symposium "Intelligent Solutions"  
We obtained theoretical results for the development of methods for solving problems of linear ordering of objects based on labeled graphs.  ...  of an r -regular graph of order n .  ...  Edge labeling  of graph G is magic, if  is an injection ) (G E into N and the weight of the vertex does not depend on the choice of the vertex. Graph, which allows magic labeling, is called magic.  ... 
dblp:conf/intsol/SemeniutaSDS21 fatcat:xpw4oodrafgylef7rihfnb2e4q

ON DISTANCE IRREGULAR LABELLING OF GRAPHS

Slamin
2017 Far East Journal of Mathematical Sciences (FJMS)  
Motivated by definition of distance magic labelling, we introduce a new type of irregular labelling whose evaluation is based on the neighbourhood of a vertex.  ...  We define a distance irregular labelling on a graph G with v vertices to be an assignment of positive integer labels to vertices so that the weights calculated at vertices are distinct.  ...  Moreover, a graph labelling based on both magic and distance was introduced by Miller et al. [7] .  ... 
doi:10.17654/ms102050919 fatcat:djfyro5q3ngxhaubtyvzgd4cju

Page 2230 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
Such a bijection is called a magic labeling of G. In this paper, the concept of the magic strength of a graph is introduced.  ...  The magic strength of a graph G is denoted by m(G) and is defined as the minimum of all con- stants where the minimum is taken over all magic labelings of G.  ... 

Super Magic Labeling Of Cycle, Wheel Andp Pn^2

Dr. D. Ramprasad
2017 Zenodo  
Further we introduce the new concept weak edge set of super magic labeling at the end.  ...  Definition 6: Let G be any graph having atleast one super magic labeling set of non pendant edges whose removal decrease the super magic strength is called weak edge set.  ...  Conclusion: In this paper, we proved that wheel n W ad 2 copies of Definition 3 : 3 The super edge magic strength of a graph G, sm(G) is defined as the minimum of all c(f) where the minimum is taken over  ... 
doi:10.5281/zenodo.842841 fatcat:2ar4xqkiszg5fgijy7hwhy42ey

SEMT valuation and strength of subdivided star of K 1,4

Salma Kanwal, Mariam Imtiaz, Nazeran Idrees, Zurdat Iftikhar, Tahira Sumbal Shaikh, Misbah Arshad, Rida Irfan
2020 Open Mathematics  
This study focuses on finding super edge-magic total (SEMT) labeling and deficiency of imbalanced fork and disjoint union of imbalanced fork with star, bistar and path; in addition, the SEMT strength for  ...  If a graph G allows at least one SEMT labeling, then the smallest of the magic constants for all possible distinct SEMT labelings of G describes SEMT strength, ( ) G sm , of G.  ...  SEMT valuation and strength of subdivided star of K 1,4  1123 Note 2. [3] Let ( ) c Γ be a magic constant of an SEMT labeling Γ of ( ) G V E , , then we end up on this statement: ∑ ∑ ( ) = ( ) ( ) + (  ... 
doi:10.1515/math-2020-0067 fatcat:rr54zznujnfsxc7ewd7mdrbpfu

Page 7051 of Mathematical Reviews Vol. , Issue 2002J [page]

2002 Mathematical Reviews  
Such a bijection is called a magic labeling of G. A magic labeling f of G is called a super magic labeling if {(V)= v}. In this paper, the concept of super magic strength of a graph is introduced.  ...  The super magic strength of a graph G is defined as the minimum of all c(f ) where the minimum runs over all super magic labelings of G and is denoted by sm(G).  ... 
« Previous Showing results 1 — 15 out of 16,697 results