- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Matching energy of unicyclic and bicyclic graphs with a given diameter
Complexity 21 (2):224-238 (2016)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Shape Effect of Piezoelectric Energy Harvester on Vibration Power Generation.Amat A. Basari - 2014 - Journal of Power and Energy Engineering 2: 117-124.
The BV-energy of maps into a manifold: relaxation and density results.Mariano Giaquinta & Domenico Mucci - 2006 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 5 (4):483-548.
VI. The measurement of the angular diameter of two intense radio. Sources-II: Diameter and structural measurements of the radio stars cygnus a and cassiopeia a.R. C. Jennison & M. K. Das Gupta - 1956 - Philosophical Magazine 1 (1):65-75.
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
Extremalt-apex trees with respect to matching energy.Kexiang Xu, Zhiqing Zheng & Kinkar Ch Das - 2016 - Complexity 21 (5):238-247.
Remarks on the iconicity and interpretation of existential graphs.Risto Hilpinen - 2011 - Semiotica 2011 (186):169-187.
Relational treatment of term graphs with bound variables.W. Kahl - 1998 - Logic Journal of the IGPL 6 (2):259-303.
Point-defect clusters and dislocation loops in bcc metals: continuum and atomistic study.M. Puigvi, Yu Osetsky & A. Serra - 2003 - Philosophical Magazine 83 (7):857-871.
On the existence of fair matching algorithms.F. Masarani & S. S. Gokturk - 1989 - Theory and Decision 26 (3):305-322.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Duplication of directed graphs and exponential blow up of proofs.A. Carbone - 1999 - Annals of Pure and Applied Logic 100 (1-3):1-67.
Succinct definitions in the first order theory of graphs.Oleg Pikhurko, Joel Spencer & Oleg Verbitsky - 2006 - Annals of Pure and Applied Logic 139 (1):74-109.
Game-theoretical semantics for Peirce's existential graphs.Robert W. Burch - 1994 - Synthese 99 (3):361 - 375.
A diameter bound for Sasaki manifolds.Yasufumi Nitta - 2014 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 13 (1):207-224.
Analytics
Added to PP
2016-06-30
Downloads
16 (#687,293)
6 months
2 (#319,278)
2016-06-30
Downloads
16 (#687,293)
6 months
2 (#319,278)
Historical graph of downloads
Author's Profile
Citations of this work
Extremalt-apex trees with respect to matching energy.Kexiang Xu, Zhiqing Zheng & Kinkar Ch Das - 2016 - Complexity 21 (5):238-247.
Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs.Xiaolin Chen & Huishu Lian - 2019 - Complexity 2019:1-7.
The Extremal Permanental Sum for a Quasi-Tree Graph.Tingzeng Wu & Huazhong Lü - 2019 - Complexity 2019:1-4.
References found in this work
Connections between generalized graph entropies and graph energy.Matthias Dehmer, Xueliang Li & Yongtang Shi - 2016 - Complexity 21 (1):35-41.
A case study of cracks in the scientific enterprise: Response to the comments.Matthias Dehmer & Abbe Mowshowitz - 2016 - Complexity 21 (S1):20-22.
Complexity of networks I: The set‐complexity of binary graphs.Nikita A. Sakhanenko & David J. Galas - 2011 - Complexity 17 (2):51-64.
Complexity of networks II: The set complexity of edge‐colored graphs.Tomasz M. Ignac, Nikita A. Sakhanenko & David J. Galas - 2012 - Complexity 17 (5):23-36.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5b5888c749-fsgz8 N