Strongly indexable graphs
From MaRDI portal
Publication:1182885
DOI10.1016/0012-365X(91)90248-ZzbMath0741.05057OpenAlexW1965901890MaRDI QIDQ1182885
S. M. Hegde, Belmannu Devadas Acharya
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(91)90248-z
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (29)
Some New Results on the Edge-Strength and Strength of Graphs ⋮ A Result on the Strength of Graphs by Factorizations of Complete Graphs ⋮ ENUMERATING SUPER EDGE-MAGIC LABELINGS FOR THE UNION OF NONISOMORPHIC GRAPHS ⋮ On indexable graphs ⋮ On the beta-number of forests with isomorphic components ⋮ A new labeling construction from the \(\otimes_h\)-product ⋮ Minimum degree conditions for the strength and bandwidth of graphs ⋮ Perfect (super) edge-magic crowns ⋮ New parameters for studying graceful properties of graphs ⋮ (Di)graph products, labelings and related results ⋮ Langford sequences and a product of digraphs ⋮ On super edge-magic decomposable graphs ⋮ Labeling constructions using digraph products ⋮ The power of digraph products applied to labelings ⋮ The jumping knight and other (super) edge-magic constructions ⋮ On $H$-antimagicness of Cartesian product of graphs ⋮ Super edge-magic labeling of \(m\)-node \(k\)-uniform hyperpaths and \(m\)-node \(k\)-uniform hypercycles ⋮ On the strength of some trees ⋮ BI-MAGIC AND OTHER GENERALIZATIONS OF SUPER EDGE-MAGIC LABELINGS ⋮ Super edge-magic models ⋮ The consecutively super edge-magic deficiency of graphs and related concepts ⋮ On super edge-antimagic total labelings of \(mK_n\) ⋮ (Di)graph decompositions and magic type labelings: a dual relation ⋮ New constructions for the \(n\)-queens problem ⋮ Unnamed Item ⋮ On super \((a,d)\)-edge-antimagic total labeling of disconnected graphs ⋮ Strongly indexable graphs and applications ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
This page was built for publication: Strongly indexable graphs
