Results 41 to 50 of about 945,213 (292)
Power Domination in Graphs [PDF]
, 2020 In this chapter, we are interested in power domination in graphs. Power domination is a variation of domination introduced to address a physical problem of monitoring a network with phasor measurement units. The originality of this variation is that some propagation happens, and the set of covered vertices results from an iterative process.
openaire +3 more sources
(Generalized) Incidence and Laplacian-Like Energies
Journal of Mathematics, 2023 In this study, for graph Γ with r connected components (also for connected nonbipartite and connected bipartite graphs) and a real number ε≠0,1, we found generalized and improved bounds for the sum of ε-th powers of Laplacian and signless Laplacian ...
A. Dilek Maden, Mohammad Tariq Rahim
doaj +1 more source
On the Powers of Signed Graphs
, 2020 A signed graph is an ordered pair $Σ=(G,σ),$ where $G=(V,E)$ is the underlying graph of $Σ$ with a signature function $σ:E\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss some properties of these powers of signed graphs.
T V, Shijin, K A, Germina, K, Shahul
openaire +2 more sources
Electronic Journal of Graph Theory and Applications, 2013 This article gives a survey of all results on the power graphs of groups and semigroups obtained in the literature. Various conjectures due to other authors, questions and open problems are also included.
Jemal Abawajy +2 more
openaire +4 more sources
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences [PDF]
Logical Methods in Computer Science, 2015 Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists a set of kernels, each of size bounded by an elementary function of r and ...
Jakub Gajarsky, Petr Hlineny
doaj +1 more source
Ars Mathematica Contemporanea, 2010 Summary: We define a new graph operation called the \(k\)th inner power. The construction-which is somewhat analogous to the \(k\)th power with respect to the direct product-seems to lend itself nicely to certain questions concerning cancellation over the direct product.
Richard H. Hammack, Neal Livesay
openaire +3 more sources
Chained graphs and some applications
Applied Network Science, 2021 This paper introduces the notions of chained and semi-chained graphs. The chain of a graph, when existent, refines the notion of bipartivity and conveys important structural information. Also the notion of a center vertex $$v_c$$ v c is introduced. It is
Anna Concas +3 more
doaj +1 more source
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Zhao, Liying Kang, Gerard J. Chang
openaire +2 more sources
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brigham, Robert C. +3 more
openaire +2 more sources
On the multipacking number of grid graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj +1 more source