Results 231 to 240 of about 6,009 (241)

Embedding of graphs in two-irregular graphs

Journal of Graph Theory, 2001
As shown by the authors in the abstract, a graph is 2-irregular if there are at most 2 vertices of the same degree in the graph. The authors prove that every graph of order \(n\) with maximum degree at most \(\frac{n}{8}-O(n^{\frac{3}{2}})\) can be embedded into a 2-irregular graph.
Axenovich, M., Füredi, Z.
openaire   +2 more sources

Irregular colorings of derived graphs of flower graph

SeMA Journal, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Rohini, M. Venkatachalam, R. Sangamithra   +2 more
openaire   +2 more sources

D-irregularity Strength of a Graph

Utilitas Mathematica
We initiate to study a \(D\)-irregular labeling, which generalizes both non-inclusive and inclusive \(d\)-distance irregular labeling of graphs. Let \(G=(V(G),E(G))\) be a graph, \(D\) a set of distances, and \(k\) a positive integer. A mapping \(\varphi\) from \(V(G)\) to the set of positive integers \(\{1,2,\dots,k\}\) is called a \(D\)-irregular \(k\
Susanto, Faisal, Simanjuntak, Rinovia, Baskoro, Edy Tri   +2 more
openaire   +2 more sources

The irregularity and total irregularity of Eulerian graphs

2018
Summary: For a graph \(G\), the irregularity and total irregularity of \(G\) are defined as \(\mathrm{irr}(G)=\sum_{uv\in (G)}| d_G(u) -d_G(v)|\) and \(\mathrm{irr}_t (G)=1/2 \sum_{uv\in (G)}| d_G(u) -d_G(v)|\), respectively, where \(d_G (u)\) is the degree of vertex \(u\).
Nasiri, R., Ellahi, H. R., Gholami, A., Fath-Tabar, G. H.   +3 more
openaire   +2 more sources

Irregularity strength of dense graphs

Journal of Graph Theory, 2008
AbstractLet G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f: E(G) → {1, 2,…, w}. For a vertex v, f(v) is defined as the sum f(e) over all edges e of G incident with v. f is called irregular, if all f(v) are distinct.
Cuckler, Bill, Lazebnik, Felix
openaire   +2 more sources

EXTREMAL IRREGULARITY OF TOTALLY SEGREGATED UNICYCLIC GRAPHS

Far East Journal of Mathematical Sciences (FJMS), 2019
Summary: The irregularity of a simple graph \(G=(V,E)\) is defined as \(irr(G)=\sum_{uv\in E(G)}|\mathrm{deg}_G(v)|\), where \(\mathrm{deg}_G(u)\) denotes the degree of a vertex \(u\in V(G)\). A graph in which any two adjacent vertices have distinct degrees is a totally segregated graph. In this paper we determine maximum and minimum of \(\{irr(G): \ G
Jorry, T. F., Parvathy, K. S.
openaire   +2 more sources

On spectral irregularity of graphs

Aequationes mathematicae
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zheng, Lu, Zhou, Bo
openaire   +2 more sources

Total Vertex Irregularity Strength of Dense Graphs

Journal of Graph Theory, 2013
AbstractConsider a graph of minimum degree δ and order n. Its total vertex irregularity strength is the smallest integer k for which one can find a weighting such that for every pair of vertices of G. We prove that the total vertex irregularity strength of graphs with is bounded from above by .
Majerski, P., Przybyło, J.
openaire   +2 more sources

Irregular Total Labellings of Generalized Petersen Graphs

Theory of Computing Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Maximum ratio of (graph) irregularities

Stijn Cambie, Jionghua Chang
openaire   +1 more source