Displaying similar documents to “On the domination of triangulated discs”

On upper bounds for total k -domination number via the probabilistic method

Saylí Sigarreta, Saylé Sigarreta, Hugo Cruz-Suárez (2023)

Kybernetika

Similarity:

For a fixed positive integer k and G = ( V , E ) a connected graph of order n , whose minimum vertex degree is at least k , a set S V is a total k -dominating set, also known as a k -tuple total dominating set, if every vertex v V has at least k neighbors in S . The minimum size of a total k -dominating set for G is called the total k -domination number of G , denoted by γ k t ( G ) . The total k -domination problem is to determine a minimum total k -dominating set of G . Since the exact problem is in general quite difficult...

A note on the double Roman domination number of graphs

Xue-Gang Chen (2020)

Czechoslovak Mathematical Journal

Similarity:

For a graph G = ( V , E ) , a double Roman dominating function is a function f : V { 0 , 1 , 2 , 3 } having the property that if f ( v ) = 0 , then the vertex v must have at least two neighbors assigned 2 under f or one neighbor with f ( w ) = 3 , and if f ( v ) = 1 , then the vertex v must have at least one neighbor with f ( w ) 2 . The weight of a double Roman dominating function f is the sum f ( V ) = v V f ( v ) . The minimum weight of a double Roman dominating function on G is called the double Roman domination number of G and is denoted by γ dR ( G ) . In this paper, we establish a new...

The small Ree group 2 G 2 ( 3 2 n + 1 ) and related graph

Alireza K. Asboei, Seyed S. S. Amiri (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let G be a finite group. The main supergraph 𝒮 ( G ) is a graph with vertex set G in which two vertices x and y are adjacent if and only if o ( x ) o ( y ) or o ( y ) o ( x ) . In this paper, we will show that G 2 G 2 ( 3 2 n + 1 ) if and only if 𝒮 ( G ) 𝒮 ( 2 G 2 ( 3 2 n + 1 ) ) . As a main consequence of our result we conclude that Thompson’s problem is true for the small Ree group 2 G 2 ( 3 2 n + 1 ) .

The Turán number of the graph 3 P 4

Halina Bielak, Sebastian Kieliszek (2014)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let e x ( n , G ) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let P i denote a path consisting of i vertices and let m P i denote m disjoint copies of P i . In this paper we count e x ( n , 3 P 4 ) .

Recognizability of finite groups by Suzuki group

Alireza Khalili Asboei, Seyed Sadegh Salehi Amiri (2019)

Archivum Mathematicum

Similarity:

Let G be a finite group. The main supergraph 𝒮 ( G ) is a graph with vertex set G in which two vertices x and y are adjacent if and only if o ( x ) o ( y ) or o ( y ) o ( x ) . In this paper, we will show that G S z ( q ) if and only if 𝒮 ( G ) 𝒮 ( S z ( q ) ) , where q = 2 2 m + 1 8 .

On path-quasar Ramsey numbers

Binlong Li, Bo Ning (2014)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let G 1 and G 2 be two given graphs. The Ramsey number R ( G 1 , G 2 ) is the least integer r such that for every graph G on r vertices, either G contains a G 1 or G ¯ contains a G 2 . Parsons gave a recursive formula to determine the values of R ( P n , K 1 , m ) , where P n is a path on n vertices and K 1 , m is a star on m + 1 vertices. In this note, we study the Ramsey numbers R ( P n , K 1 F m ) , where F m is a linear forest on m vertices. We determine the exact values of R ( P n , K 1 F m ) for the cases m n and m 2 n , and for the case that F m has no odd component. Moreover, we...

Thompson’s conjecture for the alternating group of degree 2 p and 2 p + 1

Azam Babai, Ali Mahmoudifar (2017)

Czechoslovak Mathematical Journal

Similarity:

For a finite group G denote by N ( G ) the set of conjugacy class sizes of G . In 1980s, J. G. Thompson posed the following conjecture: If L is a finite nonabelian simple group, G is a finite group with trivial center and N ( G ) = N ( L ) , then G L . We prove this conjecture for an infinite class of simple groups. Let p be an odd prime. We show that every finite group G with the property Z ( G ) = 1 and N ( G ) = N ( A i ) is necessarily isomorphic to A i , where i { 2 p , 2 p + 1 } .

Some properties of generalized distance eigenvalues of graphs

Yuzheng Ma, Yan Ling Shao (2024)

Czechoslovak Mathematical Journal

Similarity:

Let G be a simple connected graph with vertex set V ( G ) = { v 1 , v 2 , , v n } and edge set E ( G ) , and let d v i be the degree of the vertex v i . Let D ( G ) be the distance matrix and let T r ( G ) be the diagonal matrix of the vertex transmissions of G . The generalized distance matrix of G is defined as D α ( G ) = α T r ( G ) + ( 1 - α ) D ( G ) , where 0 α 1 . Let λ 1 ( D α ( G ) ) λ 2 ( D α ( G ) ) ... λ n ( D α ( G ) ) be the generalized distance eigenvalues of G , and let k be an integer with 1 k n . We denote by S k ( D α ( G ) ) = λ 1 ( D α ( G ) ) + λ 2 ( D α ( G ) ) + ... + λ k ( D α ( G ) ) the sum of the k largest generalized distance eigenvalues. The generalized distance spread of a graph G is defined as D α S ( G ) = λ 1 ( D α ( G ) ) - λ n ( D α ( G ) ) ....

Partitioning planar graph of girth 5 into two forests with maximum degree 4

Min Chen, André Raspaud, Weifan Wang, Weiqiang Yu (2024)

Czechoslovak Mathematical Journal

Similarity:

Given a graph G = ( V , E ) , if we can partition the vertex set V into two nonempty subsets V 1 and V 2 which satisfy Δ ( G [ V 1 ] ) d 1 and Δ ( G [ V 2 ] ) d 2 , then we say G has a ( Δ d 1 , Δ d 2 ) -partition. And we say G admits an ( F d 1 , F d 2 ) -partition if G [ V 1 ] and G [ V 2 ] are both forests whose maximum degree is at most d 1 and d 2 , respectively. We show that every planar graph with girth at least 5 has an ( F 4 , F 4 ) -partition.

The Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths

Halina Bielak, Kinga Dąbrowska (2015)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

The Ramsey number R ( G , H ) for a pair of graphs G and H is defined as the smallest integer n such that, for any graph F on n vertices, either F contains G or F ¯ contains H as a subgraph, where F ¯ denotes the complement of F . We study Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths and determine these numbers for some cases. We extend many known results studied in [5, 14, 18, 19, 20]. In particular we count the numbers R ( K 1 + L n , P m ) and R ( K 1 + L n , C m ) for some integers m , n , where L n is...

Generalized 3-edge-connectivity of Cartesian product graphs

Yuefang Sun (2015)

Czechoslovak Mathematical Journal

Similarity:

The generalized k -connectivity κ k ( G ) of a graph G was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k -edge-connectivity which is defined as λ k ( G ) = min { λ ( S ) : S V ( G ) and | S | = k } , where λ ( S ) denotes the maximum number of pairwise edge-disjoint trees T 1 , T 2 , ... , T in G such that S V ( T i ) for 1 i . In this paper we prove that for any two connected graphs G and H we have λ 3 ( G H ) λ 3 ( G ) + λ 3 ( H ) , where G H is the Cartesian product of G and H . Moreover, the bound is sharp. We also...

Complete pairs of coanalytic sets

Jean Saint Raymond (2007)

Fundamenta Mathematicae

Similarity:

Let X be a Polish space, and let C₀ and C₁ be disjoint coanalytic subsets of X. The pair (C₀,C₁) is said to be complete if for every pair (D₀,D₁) of disjoint coanalytic subsets of ω ω there exists a continuous function f : ω ω X such that f - 1 ( C ) = D and f - 1 ( C ) = D . We give several explicit examples of complete pairs of coanalytic sets.

Even factor of bridgeless graphs containing two specified edges

Nastaran Haghparast, Dariush Kiani (2018)

Czechoslovak Mathematical Journal

Similarity:

An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. Let G be a bridgeless simple graph with minimum degree at least 3 . Jackson and Yoshimoto (2007) showed that G has an even factor containing two arbitrary prescribed edges. They also proved that G has an even factor in which each component has order at least four. Moreover, Xiong, Lu and Han (2009) showed that for each pair of edges e 1 and e 2 of G , there is an even factor containing e 1 and e 2 ...

Spanning trees whose reducible stems have a few branch vertices

Pham Hoang Ha, Dang Dinh Hanh, Nguyen Thanh Loan, Ngoc Diep Pham (2021)

Czechoslovak Mathematical Journal

Similarity:

Let T be a tree. Then a vertex of T with degree one is a leaf of T and a vertex of degree at least three is a branch vertex of T . The set of leaves of T is denoted by L ( T ) and the set of branch vertices of T is denoted by B ( T ) . For two distinct vertices u , v of T , let P T [ u , v ] denote the unique path in T connecting u and v . Let T be a tree with B ( T ) . For each leaf x of T , let y x denote the nearest branch vertex to x . We delete V ( P T [ x , y x ] ) { y x } from T for all x L ( T ) . The resulting subtree of T is called the reducible stem...