A dynamic survey of graph labeling

From MaRDI portal
Revision as of 15:24, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1382967

zbMath0953.05067MaRDI QIDQ1382967

Joseph A. Gallian

Publication date: 2 April 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Surveys/

File on IPFS




Related Items (only showing first 100 items - show all)

On the generation of alpha graphsMinimum Coprime Labelings of Generalized Petersen and Prism GraphsConnected certified domination edge critical and stable graphsTadpole domination number of graphsMMD labeling of EASS of Cartesian product of two graphsOn face-magic labelings of regular tesselationsThe maximum linear arrangement problem for trees under projectivity and planarityAntimagic orientation of forestsOn closed distance magic circulants of valency up to 5A proof of the multiplicative 1-2-3 conjectureMagic partially filled arrays on abelian groupsGraph labelings obtainable by random walksLeverage centrality analysis of infrastructure networksKlein cordial trees and odd cyclic cordial friendship graphsTriangulations, order polytopes, and generalized snake posetsLabeling trees of small diameters with consecutive integersFinding large rainbow trees in colourings of \(K_{n, n}\)Neighborhood balanced colorings of graphsThe weak \((2, 2)\)-labelling problem for graphs with forbidden induced structuresGeneration of anti-magic graphs from binary graph productsk-Zumkeller graphs through splitting of graphsGroup distance magic labeling of tetravalent circulant graphsUnnamed ItemGlobal and local structure‐based influential nodes identification in wheel‐type networksAdditively graceful signed graphsPerfectly packing graphs with bounded degeneracy and many leavesThe reflexive edge strength of toroidal fullereneAgglomeration-Based Node Importance Analysis in Wheel-Type NetworksSum-distinguishing number of sparse hypergraphsA linear algorithm for radio \(k\)-coloring powers of paths having small diameterAnalytic odd mean labeling of union and identification of some graphsLocal distance antimagic chromatic number for the union of star and double star graphsGraph decompositions in projective geometriesA study on the modular sumset labeling of graphsSwitched signed graphs of integer additive set-valued signed graphsUnnamed ItemUnnamed ItemUnnamed ItemDecomposing almost complete graphs by random treesUnnamed ItemGroup distance magic and antimagic graphsOn integral sum graphsSupermagic graphs having a saturated vertexThe space complexity of sum labellingMinimum Coprime Labelings for Operations on GraphsUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemIt Is All LabelingProductive and sum graph labelings: a surveyOn b-coloring of central graph of some graphsGraceful labeling of power graph of group Z2k−1 × Z4On the Oberwolfach problem for single-flip 2-factors via graceful labelingsEdge-decompositions ofKn,ninto isomorphic copies of a given treeOn elegant labelling and magic labelling of large-scale graphsAny tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graphOn the algorithmic complexity of zero-sum edge-coloringUnnamed ItemOn zero-sum \({\mathbb{Z}_k}\)-magic labelings of 3-regular graphsEdge pair sum labeling of some cartesian product of graphsThe vertex Euclidean properties of graphsAntimagic labeling of some biregular bipartite graphsRainbow spanning trees in abelian groupsA note on prime labeling \(k\)-partite \(k\)-graphsGoing wide with the 1-2-3 conjectureOn cyclic decompositions of the complete graph into the bipartite generalized Petersen graph \(P ( n , 3 )\)The cordiality of the sum and union of two fourth power of paths and cyclesConstruction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled treesTwo constructions of \(H\)-antimagic graphsPerfect (super) edge-magic crownsEdge consecutive gracefulness of a graphGraceful labeling of some zero divisor graphsIsoperimetry, stability, and irredundance in direct productsA novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classesOn the Uniform Random Generation of Non Deterministic Automata Up to IsomorphismFurther results on edge even graceful labeling of the join of two graphsSignless Laplacian energy of a first KCD matrixLabeled trees generating complete, compact, and discrete ultrametric spacesOn \(\sigma \)-tripartite labelings of odd prisms and even Möbius laddersLocal antimagic labeling of graphsSketchy tweets: ten minute conjectures in graph theoryBalanced equi-\(n\)-squaresAntimagic labeling of generalized pyramid graphsGroup labeling of some graphsEmbedding rainbow trees with applications to graph labelling and decompositionAntibandwidth and cyclic antibandwidth of Hamming graphsSome new results on prime cordial labelingCaterpillars are antimagicThe jumping knight and other (super) edge-magic constructions3-difference cordiality of some corona graphsEven vertex equitable even labeling for snake related graphsOdd harmonious labeling of grid graphsSuper vertex mean labeling of cycles through different waysOdd Vertex equitable even labeling of cyclic snake related graphsSolution of the conjecture: if \(n\equiv 0 \pmod 4\), \(n>4\), then \(K_n\) has a super vertex-magic total labelingComputation of Narayana Prime Cordial Labeling of Book GraphsOn a Relationship between Completely Separating Systems and Antimagic Labeling of Regular GraphsOn Antimagic Labeling for Generalized Web and Flower Graphs







This page was built for publication: A dynamic survey of graph labeling