Irregular networks, regular graphs and integer matrices with distinct row and column sums
From MaRDI portal
DOI10.1016/0012-365X(89)90321-XzbMATH Open0685.05029MaRDI QIDQ1825880FDOQ1825880
Authors: Ralph Faudree, R. H. Schelp, Michael Jacobson, Jeno Lehel
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (40)
- Distant irregularity strength of graphs
- A magic rectangle set on abelian groups and its application
- Modular irregularity strength of graphs
- Irregularity strength of regular graphs of large degree
- Irregularity strength of dense graphs
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- Minimum-weight edge discriminators in hypergraphs
- Centrally symmetric and magic rectangles
- Distant sum distinguishing index of graphs
- On edge irregularity strength of graphs
- Distant sum distinguishing index of graphs with bounded minimum degree
- On irregular total labellings
- Title not available (Why is that?)
- Distant total irregularity strength of graphs via random vertex ordering
- The irregularity strength of \(K_{m,m}\) is 4 for odd m
- On a total version of 1-2-3 conjecture
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
- Irregular embeddings of multigraphs with fixed chromatic number
- The irregularity strength of \(tK_ p\)
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- Random hypergraph irregularity
- Distant irregularity strength of graphs with bounded minimum degree
- The irregularity strength and cost of the union of cliques
- A survey of irregularity strength
- On the edge irregularity strength for some classes of plane graphs
- The consecutiveness of complete graph union
- A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
- On H-irregularity strength of graphs
- On the reflexive edge strength of the circulant graphs
- On the total irregularity strength of convex polytope graphs
- On the number of irregular assignments on a graph
- ON EDGE IRREGULARITY STRENGTH OF SOME GRAPHS
- Irregularity strength of the toroidal grid
- Relaxing the injectivity constraint on arithmetic and harmonious labelings
- On the edge irregularity strength of corona product of cycle with isolated vertices
- Modular irregularity strength on some flower graphs
- On the edge irregularity strength of corona product of graphs with cycle
- A smallest irregular oriented graph containing a given diregular one
- Distant total sum distinguishing index of graphs
- Edge and modular edge irregularity strength of some path related graphs
This page was built for publication: Irregular networks, regular graphs and integer matrices with distinct row and column sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825880)