A5036519893- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Graph theory and applications
- Complexity and Algorithms in Graphs
- Interconnection Networks and Systems
- graph theory and CDMA systems
- Limits and Structures in Graph Theory
- Optimization and Search Problems
- Meromorphic and Entire Functions
- Finite Group Theory Research
- Cooperative Communication and Network Coding
- Game Theory and Voting Systems
- Game Theory and Applications
- Mathematics and Applications
- Nuclear Receptors and Signaling
- Matrix Theory and Algorithms
- Physics and Engineering Research Articles
- Graphene research and applications
- Advanced Algebra and Logic
- History and Theory of Mathematics
- Advanced Combinatorial Mathematics
- Coding theory and cryptography
- Iterative Methods for Nonlinear Equations
- Mathematical functions and polynomials
- Color Science and Applications
RWTH Aachen University
2014-2024
Azarbaijan Shahid Madani University
2016-2022
Dr. A. Ramachandran's Diabetes Hospitals
2021
Sirjan University of Technology
2018
Islamic Azad University, Khoy Branch
2018
University of Architecture, Civil Engineering and Geodesy
2016
University of Tabriz
2015
Springer Nature (Germany)
1996
Westfälische Hochschule
1994-1996
FH Aachen
1985-1993
In this work, we continue to survey what has been done on the Roman domination. More precisely, will present in two sections several variations of dominating functions as well signed version some these functions. It should be noted that a first part comprising 9 varieties is published chapter book "Topics domination graphs" edited by T.W. Haynes, S.T. Hedetniemi and M.A. Henning. We recall function f:V→{0,1,2} (or just RDF) if every vertex u for which f(u) = 0 adjacent at least one v f(v) 2....
Über diese Arbeit wurde auf einem “Tag der Funktionenthcorie” am 15. und 16.6.1984 an RWTH Aachen vom zweiten Verfasser berichtet. Recently E. Mues and N. Steinmetz independently G. Gundersen proved that if a nonconstant meromorphic function f shares two different non-zero values b (counting multiplicities) with its first derivative, then f′=f.ln this paper the following theorem is proved: If finite value f′ f″ = f.In case of entire conditions can be weakened considerably.
A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in cite{bhh} as function$f:V(G)to {0,1,2,3}$ having the property that if $f(v)=0$, then $v$ must have at least twoneighbors assigned 2 under $f$ or one neighbor $w$ $f(w)=3$, and $f(v)=1$, haveat $u$ $f(u)ge 2$. The weight of sum$sum_{vin V(G)}f(v)$, minimum Romandomination number $gamma_{dR}(G)$ $G$.A ${f_1,f_2, dots,f_d}$ distinct functions that$sum_{i=1}^df_i(v)le 3$ for each $vin V(G)$ called family (of...
Abstract The restricted‐edge‐connectivity of a graph G , denoted by λ′( ), is defined as the minimum cardinality over all edge‐cuts S where ‐ contains no isolated vertices. called λ′‐optimal, if ) = ξ( edge‐degree in G. A super‐edge‐connected, every edge‐cut consists edges adjacent to vertex degree. In this paper, we present sufficient conditions for arbitrary, triangle‐free, and bipartite graphs be well depending on clique number. These imply super‐edge‐connectivity, δ ( ≥ 3, equality...
Let k be a positive integer, and let G simple graph with vertex set V (G). A Roman k-dominating function on is f : (G) <TEX>$\rightarrow$</TEX> {0, 1, 2} such that every u for which f(u) = 0 adjacent to at least vertices <TEX>$\upsilon_1,\;\upsilon_2,\;{\ldots},\;\upsilon_k$</TEX> <TEX>$f(\upsilon_i)$</TEX> 2 i 2, <TEX>$\ldot$</TEX>, k. The weight of the value f(V (G)) <TEX>$\sum_{u{\in}v(G)}$</TEX> f(u). minimum called k-domination number <TEX>${\gamma}_{kR}$</TEX>(G) G. Note 1-domination...