Characterization of the Minimizing Graph of the Connected Graphs Whose Complements Are Bicyclic

Author： Javaid Muhammad  

Publisher： MDPI

E-ISSN： 2227-7390|5|1|18-18

ISSN： 2227-7390

Source： Mathematics, Vol.5, Iss.1, 2017-03, pp. : 18-18

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Study on the Nourishing Number of Graphs and Graph Powers

By Naduvath Sudev   Augustine Germina  

Mathematics, Vol. 3, Iss. 1, 2015-03 ,pp. : 29-39

MDPI

Access to resources Recommend Favorite

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree

By Akutsu Tatsuya   Tamura Takeyuki  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 119-135

MDPI

Access to resources Recommend Favorite

Graph Theory

By M. Rodriguez Jose  

Symmetry, Vol. 10, Iss. 1, 2018-01 ,pp. : 32-32

MDPI

Access to resources Recommend Favorite

Duality in Geometric Graphs: Vector Graphs, Kirchhoff Graphs and Maxwell Reciprocal Figures

By Reese Tyler   Paffenroth Randy   Fehribach Joseph D.  

Symmetry, Vol. 8, Iss. 3, 2016-02 ,pp. : 9-9

MDPI

Access to resources Recommend Favorite

Graph Compression by BFS

By Apostolico Alberto   Drovandi Guido  

Algorithms, Vol. 2, Iss. 3, 2009-08 ,pp. : 1031-1044

MDPI

Access to resources Recommend Favorite