The splitting number of the complete graph in the projective plane

1987 ◽  
Vol 3 (1) ◽  
pp. 349-356 ◽  
Author(s):  
Nora Hartsfield
Keyword(s):  
Projective Plane ◽  
Complete Graph ◽  
Splitting Number

Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties

1969 ◽  
Vol 21 ◽  
pp. 992-1000 ◽  
Author(s):  
L. W. Beineke
Keyword(s):  
Projective Plane ◽  
Complete Graph ◽  
Planar Graphs ◽  
Complete Graphs ◽  
Minimum Number ◽  
Double Torus

Although the problem of finding the minimum number of planar graphs into which the complete graph can be decomposed remains partially unsolved, the corresponding problem can be solved for certain other surfaces. For three, the torus, the double-torus, and the projective plane, a single proof will be given to provide the solutions. The same questions will also be answered for bicomplete graphs.

The splitting number of the complete graph

1985 ◽  
Vol 1 (1) ◽  
pp. 311-329 ◽  
Author(s):  
Nora Hartsfield ◽  
Brad Jackson ◽  
Gerhard Ringel
Keyword(s):  
Complete Graph ◽  
Splitting Number

Gilles Deleuze's Luminous Philosophy

2020 ◽  
Author(s):  
Hanjo Berressem
Keyword(s):  
Projective Plane ◽  
Visual Arts ◽  
Whole Body ◽  
Literary Studies ◽  
Chronological Order ◽  
Real Projective Plane ◽  
Cinema Studies ◽  
The Real

Providing a comprehensive reading of Deleuzian philosophy, Gilles Deleuze’s Luminous Philosophy argues that this philosophy’s most consistent conceptual spine and figure of thought is its inherent luminism. When Deleuze notes in Cinema 1 that ‘the plane of immanence is entirely made up of light’, he ties this philosophical luminism directly to the notion of the complementarity of the photon in its aspects of both particle and wave. Engaging, in chronological order, the whole body and range of Deleuze’s and Deleuze and Guattari’s writing, the book traces the ‘line of light’ that runs through Deleuze’s work, and it considers the implications of Deleuze’s luminism for the fields of literary studies, historical studies, the visual arts and cinema studies. It contours Deleuze’s luminism both against recent studies that promote a ‘dark Deleuze’ and against the prevalent view that Deleuzian philosophy is a philosophy of difference. Instead, it argues, it is a philosophy of the complementarity of difference and diversity, considered as two reciprocally determining fields that are, in Deleuze’s view, formally distinct but ontologically one. The book, which is the companion volume toFélix Guattari’s Schizoanalytic Ecology, argues that the ‘real projective plane’ is the ‘surface of thought’ of Deleuze’s philosophical luminism.

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.

scholarly journals Group-labeled light dual multinets in the projective plane

2018 ◽  
Vol 341 (8) ◽  
pp. 2121-2130 ◽  
Author(s):  
Gábor Korchmáros ◽  
Gábor P. Nagy
Keyword(s):  
Projective Plane

scholarly journals On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 512
Author(s):  
Maryam Baghipur ◽  
Modjtaba Ghorbani ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Distance Matrix ◽  
Upper And Lower Bounds ◽  
Laplacian Eigenvalue ◽  
Signless Laplacian ◽  
Graph Parameters ◽  
Simple Connected Graph ◽  
Second Largest Eigenvalue ◽  
Reciprocal Distance Matrix

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the total reciprocal distance vertices. In the present work, some upper and lower bounds for the second-largest eigenvalue of the signless Laplacian reciprocal distance matrix of graphs in terms of various graph parameters are investigated. Besides, all graphs attaining these new bounds are characterized. Additionally, it is inferred that among all connected graphs with n vertices, the complete graph Kn and the graph Kn−e obtained from Kn by deleting an edge e have the maximum second-largest signless Laplacian reciprocal distance eigenvalue.

Sign in / Sign up

Export Citation Format

Share Document