Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2008/06/03
-
Journal
-
Indian UGC (journal)
-
Refrences47
-
Citations7
-
Julie Christophe
-
Sophie Dewez
-
Jean‐Paul Doignon
-
Gilles Fasbender
-
Philippe Grégoire
-
David Huygens
-
Martine Labbé
-
Sourour Elloumi
-
Hadrien Mélot
-
Hande Yaman
Abstract
Cite
Christophe, Julie, et al. “Linear Inequalities Among Graph Invariants: Using GraPHedron to Uncover Optimal Relationships”. Networks, vol. 52, no. 4, 2008, pp. 287-98, https://doi.org/10.1002/net.20250.
Christophe, J., Dewez, S., Doignon, J., Fasbender, G., Grégoire, P., Huygens, D., Labbé, M., Elloumi, S., Mélot, H., & Yaman, H. (2008). Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks, 52(4), 287-298. https://doi.org/10.1002/net.20250
Christophe J, Dewez S, Doignon J, Fasbender G, Grégoire P, Huygens D, et al. Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks. 2008;52(4):287-98.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Engineering (General)
Civil engineering (General)
Technology
Manufactures
Production management
Operations management
You May Also Like
- Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
- Feature Article: Optimization for simulation: Theory vs. Practice
- Combinatorial Auctions: A Survey
- A survey on clustering algorithms for wireless sensor networks
- The Internet of Things vision: Key features, applications and open issues
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Variable neighborhood search for extremal graphs 12. A note on the variance of bounded degrees in graphs | 2005 | |||
| Variable neighborhood search for extremal graphs 8. Variations on graffiti 105 | 2001 | |||
| The irregularity of a graph | Ars Combinatoria |
| 1997 | |
| Graph theoretical results obtained by the support of the expert system “graph” | 1994 | |||
| On conjectures of graffiti IV | 1990 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| The size of graphs with given feedback vertex number | Discrete Applied Mathematics |
| 1 | 2022 |
| Automated conjecturing III | Annals of Mathematics and Artificial Intelligence |
| 2 | 2017 |
| Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited | Artificial Intelligence |
| 5 | 2016 |
ON THE SUM OF INDEPENDENCE NUMBER AND AVERAGE DEGREE OF A GRAPH | Discrete Mathematics, Algorithms and Applications |
| 2011 | |
| A survey of automated conjectures in spectral graph theory | Linear Algebra and its Applications |
| 23 | 2010 |
Citations Analysis
The category
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods 6
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Fibonacci index and stability number of graphs: a polyhedral study and was published in 2009. The most recent citation comes from a 2022 study titled The size of graphs with given feedback vertex number. This article reached its peak citation in 2009, with 2 citations. It has been cited in 6 different journals. Among related journals, the Linear Algebra and its Applications cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.