Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 1792593 - MaRDI portal

scientific article; zbMATH DE number 1792593

From MaRDI portal
Publication:4552180

zbMath0994.05135MaRDI QIDQ4552180

Pranava K. Jha, Ashok Narayanan, Vivek Sunder, Karthik Sundaram, Puneet Sood

Publication date: 29 August 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (28)

The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs\(L(p,q)\) labeling of \(d\)-dimensional grids\(L(j, k)\)-number of direct product of path and cycle\(L(2, 1)\)-labelings of the edge-path-replacement of a graphThe \(L(2,1)\)-labeling on planar graphsDistance-two labelings of digraphs\(L(d,1)\)-labelings of the edge-path-replacement of a graphExact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius stripsComputing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbersOn the \(L(2,1)\)-labelings of amalgamations of graphsThe \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groupsDistance two labelling and direct products of graphsThe minimum span of \(L(2,1)\)-labelings of generalized flowersThe \(L(2,1)\)-labeling on the skew and converse skew products of graphs\(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphsThe \(L(2,1)\)-labeling on graphs and the frequency assignment problemNordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers\(L(2,1)\)-labeling of direct product of paths and cyclesA note on collections of graphs with non-surjective lambda labelings\(L(2,1)\)-labelings of Cartesian products of two cyclesOn critical trees labeled with a condition at distance twoColoring the square of the Cartesian product of two cyclesA survey on labeling graphs with a condition at distance two\(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graphThe \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applicationsOn \(L(d,1)\)-labeling of Cartesian product of a cycle and a pathOn \(L(2,1)\)-labelings of Cartesian products of paths and cyclesDistance-two labelings of graphs




This page was built for publication: