scholarly journals Identifying codes in the direct product of a path and a complete graph

2020 ◽  
Author(s):  
Smruti A. Mane ◽  
Neeta V. Shinde ◽  
Baloo N. Waphare
Keyword(s):  
Direct Product ◽  
Complete Graph ◽  
Identifying Codes

scholarly journals On the r-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph

2021 ◽  
Vol 6 (2) ◽  
pp. 1470-1496
Author(s):  
T. Deepa ◽  
◽  
Raúl M. Falcón ◽  
M. Venkatachalam ◽  
Keyword(s):  
Direct Product ◽  
Complete Graph ◽  
Wheel Graph

$$L(1,1)$$ L ( 1 , 1 ) -labelling of the direct product of a complete graph and a cycle

2013 ◽  
Vol 30 (3) ◽  
pp. 803-811 ◽  
Author(s):  
Byeong Moon Kim ◽  
Yoomi Rho ◽  
Byung Chul Song
Keyword(s):  
Direct Product ◽  
Complete Graph

scholarly journals Identifying codes of the direct product of two cliques

2014 ◽  
Vol 36 ◽  
pp. 159-171 ◽  
Author(s):  
Douglas F. Rall ◽  
Kirsti Wash
Keyword(s):  
Direct Product ◽  
Identifying Codes

Equitable Total Coloring of Direct Product of Path and Cycle

2019 ◽  
Vol 10 (7) ◽  
pp. 1476-1481
Author(s):  
S. Moidheen Aliyar ◽  
S. Manimaran ◽  
K. Manikandan
Keyword(s):  
Direct Product ◽  
Total Coloring

Sport and nationalism in the Republic of North Macedonia

Focaal ◽  
2019 ◽  
pp. 1-13
Author(s):  
Vasiliki P. Neofotistos
Keyword(s):  
Direct Product ◽  
Nation Building ◽  
National History ◽  
Sports Teams ◽  
The Balkans ◽  
The North ◽  
Political Forces ◽  
The Republic

Using the Republic of North Macedonia as a case study, this article analyzes the processes through which national sports teams’ losing performance acquires a broad social and political significance. I explore claims to sporting victory as a direct product of political forces in countries located at the bottom of the global hierarchy that participate in a wider system of coercive rule, frequently referred to as empire. I also analyze how public celebrations of claimed sporting victories are intertwined with nation-building efforts, especially toward the global legitimization of a particular version of national history and heritage. The North Macedonia case provides a fruitful lens through which we can better understand unfolding sociopolitical developments, whereby imaginings of the global interlock with local interests and needs, in the Balkans and beyond.

On the g-hypergroupoids associated with g-hypergraphs

Filomat ◽  
2017 ◽  
Vol 31 (15) ◽  
pp. 4819-4831 ◽  
Author(s):  
Mehdi Farshi ◽  
Bijan Davvaz ◽  
Saeed Mirvakili
Keyword(s):  
Direct Product ◽  
Fundamental Relation ◽  
Join Space ◽  
Commutative Hypergroup ◽  
Regular Relation

In this paper, we associate a partial g-hypergroupoid with a given g-hypergraph and analyze the properties of this hyperstructure. We prove that a g-hypergroupoid may be a commutative hypergroup without being a join space. Next, we define diagonal direct product of g-hypergroupoids. Further, we construct a sequence of g-hypergroupoids and investigate some relationships between it?s terms. Also, we study the quotient of a g-hypergroupoid by defining a regular relation. Finally, we describe fundamental relation of an Hv-semigroup as a g-hypergroupoid.

scholarly journals On the Generalized Distance Energy of Graphs

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Connected Graph ◽  
Distance Matrix ◽  
Wiener Index ◽  
Diagonal Matrix ◽  
Upper And Lower Bounds ◽  
Star Graph ◽  
Extremal Graphs ◽  
Generalized Distance

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

Sign in / Sign up

Export Citation Format

Share Document