Results 101 to 110 of about 59,909 (247)
The irregularity of graphs under graph operations
Discussiones Mathematicae Graph Theory, 2014 The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj +1 more source
A Class of Graphs Approaching Vizing's Conjecture
Theory and Applications of Graphs, 2016 For any graph G=(V,E), a subset S of V dominates G if all vertices are contained in the closed neighborhood of S, that is N[S]=V. The minimum cardinality over all such S is called the domination number, written γ(G). In 1963, V.G. Vizing conjectured that
Aziz Contractor, Elliot Krop
doaj +1 more source
Green Human Resource Management and ISO 14001: Toward Environmental Sustainability in Organizations
Human Resource Development Quarterly, EarlyView.ABSTRACT The current climate change scenario imposes urgent challenges to different economic sectors around the world, requiring companies to adopt new strategies to achieve sustainable development goals (SDGs) while enhancing environmental awareness.
Eduardo Ortega +2 more
wiley +1 more source
Monotone Chromatic Number of Graphs
International Journal of Analysis and Applications, 2020 For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C: V (G) → {1, 2, ..., k} (using the non-negative integers {1, 2, ..., k} as colors).
Anwar Saleh +3 more
doaj
2- Cartesian Product of Special Graphs
International Journal of Mathematics and Soft Computing, 2014 The cartesian product of two graphs has been studied by many authors and has been generalized by introducing 2 - cartesian product G1 _2 G2 of two graphs G1 and G2. In this paper, we obtain G1 _2 G2; for Pn, Cn and Ks;t.
Himali S. Mehta, U. P. Acharya
openaire +1 more source
Integer domination of Cartesian product graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Choudhary, K. +2 more
openaire +1 more source
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k $k$‐critical yet L $L$‐colorable with ...
Anton Bernshteyn +3 more
wiley +1 more source
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source
FORWARDING INDICES OF CARTESIAN PRODUCT GRAPHS
Taiwanese Journal of Mathematics, 2006 For a given connected graph $G$ of order $n$, a routing $R$ is a set of $n(n-1)$ elementary paths specified for every ordered pair of vertices in $G$. The vertex-forwarding index $\xi(G)$ (the edge-forwarding index $\pi(G)$) of $G$ is the maximum number of paths of $R$ passing through any vertex (resp. edge) in $G$. In this paper we consider the vertex-
Xu, Jun-Ming, Xu, Min, Hou, Xinmin
openaire +2 more sources
Sensitivity and Hamming Graphs
Journal of Graph Theory, EarlyView.ABSTRACT For any m ≥ 3 $m\ge 3$ we show that the Hamming graph H ( n , m ) $H(n,m)$ admits an imbalanced partition into m $m$ sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m $m$‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio +3 more
wiley +1 more source